596 search results - page 58 / 120 » Subtyping Recursive Types |
FOSSACS
2010
Springer
15 years 8 months ago
2010
Springer
For many application-level distributed protocols and parallel algorithms, the set of participants, the number of messages or the interaction structure are only known at run-time. T...
124
click to vote
CADE
2000
Springer
15 years 5 months ago
2000
Springer
We provide techniques to integrate resolution logic with equality in type theory. The results may be rendered as follows. − A clausification procedure in type theory, equipped w...
109
click to vote
ESOP
2009
Springer
15 years 5 months ago
2009
Springer
This paper studies inductive definitions involving binders, in which aliasing between free and bound names is permitted. Such aliasing occurs in informal specifications of operatio...
FPCA
1991
15 years 4 months ago
1991
We develop a calculus for lazy functional programming based on recursion operators associated with data type de nitions. For these operators we derive various algebraic laws that ...
103
click to vote
JSYML
2010
14 years 8 months ago
2010
We prove that the (non-intuitionistic) law of the double negation shift has a bounded functional interpretation with bar recursive functionals of finite type. As an application, we...