277 search results - page 40 / 56 » A First-Order Theory of Types and Polymorphism in Logic Prog... |
TACS
2001
Springer
14 years 18 hour ago
2001
Springer
We give a logic programming language based on Fiore, Plotkin and Turi’s binding algebras. In this language, we can use not only first-order terms but also terms involving variab...
IBERAMIA
2004
Springer
14 years 29 days ago
2004
Springer
The theory of multi-adjoint logic programs has been introduced as a unifying framework to deal with uncertainty, imprecise data or incomplete information. From the applicative part...
ICFP
2009
ACM
14 years 8 months ago
2009
ACM
We define logical relations between the denotational semantics of a simply typed functional language with recursion and the operational behaviour of low-level programs in a varian...
SIGDOC
2003
ACM
14 years 25 days ago
2003
ACM
Artificial intelligence techniques have found a number of applications in hypermedia, mostly in two specific areas, user interface, particularly adaptive ones and information sear...
PEPM
2009
ACM
14 years 4 months ago
2009
ACM
We show that a wide class of bidirectional data-flow analyses and program optimizations based on them admit declarative descriptions in the form of type systems. The salient feat...