137 search results - page 20 / 28 » Polymorphic Directional Types for Logic Programming |
108
click to vote
ESOP
2001
Springer
15 years 6 months ago
2001
Springer
Abstract. We present a proof theoretical method for de-compiling lowlevel code to the typed lambda calculus. We first define a proof system for a low-level code language based on...
106
click to vote
CTCS
1989
Springer
15 years 6 months ago
1989
Springer
We introduce the notion of a candidate for “multiple valued universal constructions” and define stable functors (which generalise functors with left adjoints) in terms of fac...
134
Voted
POPL
2010
ACM
15 years 11 months ago
2010
ACM
The method of logical relations is a classic technique for proving the equivalence of higher-order programs that implement the same observable behavior but employ different intern...
110
click to vote
FPCA
1989
15 years 6 months ago
1989
Parametric polymorphism constrains the behavior of pure functional programs in a way that allows the derivation of interesting theorems about them solely from their types, i.e., v...
148
click to vote
ICFP
2010
ACM
15 years 3 months ago
2010
ACM
A wide range of computer programs, including compilers and theorem provers, manipulate data structures that involve names and binding. However, the design of programming idioms wh...