12 search results - page 3 / 3 » A feasible algorithm for typing in Elementary Affine Logic |
ESOP
2001
Springer
13 years 9 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...
ICLP
2005
Springer
13 years 10 months ago
2005
Springer
Any finite tree automaton (or regular type) can be used to construct act interpretation of a logic program, by first determinising and completing the automaton to get a pre-inter...