1742 search results - page 159 / 349 » An Applicative Module Calculus |
171
click to vote
TABLEAUX
1999
Springer
15 years 10 months ago
1999
Springer
We combine techniques originally developed for refutational first-order theorem proving within the clause tree framework with techniques for minimal model computation developed wi...
143
click to vote
POPL
1998
ACM
15 years 10 months ago
1998
ACM
Data structures with a hole, in other words data structures with an uninitialized field, are useful to write efficient programs: they enable us to construct functional data stru...
161
click to vote
KBSE
1997
IEEE
15 years 10 months ago
1997
IEEE
Proofs in the Nuprl system, an implementation of a constructive type theory, yield “correct-by-construction” programs. In this paper a new methodology is presented for extract...
168
click to vote
ICPADS
1996
IEEE
15 years 10 months ago
1996
IEEE
A new multiagent programmingparadigm based on the transactional logic model' is developed. This paradigm enables us to construct a Distributed agent transactional program (DA...
153
click to vote
CADE
1994
Springer
15 years 10 months ago
1994
Springer
Even though it is not very often admitted, partial functions do play a significant role in many practical applications of deduction systems. Kleene has already given a semantic acc...