21 search results - page 4 / 5 » Refinement Types as Proof Irrelevance |
163
Voted
CADE
2005
Springer
16 years 3 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...
143
Voted
LICS
1994
IEEE
15 years 7 months ago
1994
IEEE
The theory of cut-free sequent proofs has been used to motivate and justify the design of a number of logic programming languages. Two such languages, Prolog and its linear logic ...
142
Voted
ECAI
2004
Springer
15 years 7 months ago
2004
Springer
We describe a flexible approach to automated reasoning, where non-theorems can be automatically altered to produce proved results which are related to the original. This is achieve...
128
Voted
CORR
2006
Springer
15 years 3 months ago
2006
Springer
We investigate families of infinite automata for context-sensitive languages. An infinite automaton is an infinite labeled graph with two sets of initial and final vertices. Its la...
139
Voted
POPL
1992
ACM
15 years 7 months ago
1992
ACM
Polymorphic record calculi have recently attracted much attention as a typed foundation for objectoriented programming. This is based on the fact that a function that selects a fi...