2777 search results - page 72 / 556 » Example centric programming |
191
click to vote
CADE
2005
Springer
16 years 6 months ago
2005
Springer
We describe the design and implementation of a higher-order tabled logic programming interpreter where some redundant and infinite computation is eliminated by memoizing sub-comput...
149
click to vote
MFCS
2007
Springer
16 years 13 days ago
2007
Springer
In computability theory, program self-reference is formalized by the not-necessarily-constructive form of Kleene’s Recursion Theorem (krt). In a programming system in which krt h...
172
click to vote
SAS
2001
Springer
15 years 10 months ago
2001
Springer
We present the implementation of cTI, a system for universal left-termination inference of logic programs, which heavily relies on static analysis techniques. Termination inference...
174
click to vote
CLUSTER
2000
IEEE
15 years 10 months ago
2000
IEEE
We propose a programming model for distributed concurrent systems with mobile objects in the context of a process calculus. Code mobility is induced by lexical scoping on names. O...
158
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...