Abstract
This paper describes a calculus of partial recursive functions that range over arbitrary and possibly higher-order objects in LF [HHP93]. Its most novel features include recursion under λ-binders and matching against dynamically introduced parameters.
Cite
CITATION STYLE
APA
Schürmann, C. (2001). Recursion for higher-order encodings. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2142, pp. 585–599). Springer Verlag. https://doi.org/10.1007/3-540-44802-0_41
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free