Sciweavers

3470 search results - page 182 / 694
» Head-Elementary-Set-Free Logic Programs
Sort
View
ENTCS
2002
84views more  ENTCS 2002»
15 years 6 months ago
Programming Autonomous Robots in Curry
In this paper we present a framework to program autonomous robots in the declarative multi-paradigm language Curry. This is an experiment to use high-level declarative programming...
Michael Hanus, Klaus Höppner
ESOP
2000
Springer
15 years 10 months ago
Compile-Time Debugging of C Programs Working on Trees
We exhibit a technique for automatically verifying the safety of simple C programs working on tree-shaped data structures. We do not consider the complete behavior of programs, but...
Jacob Elgaard, Anders Møller, Michael I. Sc...
ACL
1997
15 years 7 months ago
Representing Constraints with Automata
In this paper we describe an approach to constraint based syntactic theories in terms of finite tree automata. The solutions to constraints expressed in weak monadic second order ...
Frank Morawietz, Tom Cornell
CORR
2004
Springer
123views Education» more  CORR 2004»
15 years 6 months ago
Light types for polynomial time computation in lambda-calculus
We present a polymorphic type system for lambda calculus ensuring that welltyped programs can be executed in polynomial time: dual light affine logic (DLAL). DLAL has a simple typ...
Patrick Baillot, Kazushige Terui
IGPL
2011
14 years 9 months ago
Generalized ordinal sums and translations
We extend the lattice embedding of the axiomatic extensions of the positive fragment of intuitionistic logic into the axiomatic extensions of intuitionistic logic to the setting of...
Nikolaos Galatos