PlumX Metrics
Embed PlumX Metrics

General recursion on second order term algebras

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), ISSN: 1611-3349, Vol: 2051 LNCS, Page: 15-30
2001
  • 2
    Citations
  • 0
    Usage
  • 2
    Captures
  • 0
    Mentions
  • 0
    Social Media
Metric Options:   Counts1 Year3 Year

Metrics Details

Conference Paper Description

Extensions of the simply typed lambda calculus have been used as a metalanguage to represent "higher order term algebras", such as, for instance, formulas of the predicate calculus. In this representa- tion bound variables of the object language are represented by bound variables of the metalanguage. This choice has various advantages but makes the notion of "recursive definition" on higher order term algebras more subtle than the corresponding notion on first order term algebras. Despeyroux, Pfenning and Schürmann pointed out the problems that arise in the proof of a canonical form theorem when one combines higher order representations with primitive recursion. In this paper we consider a stronger scheme of recursion and we prove that it captures all partial recursive functions on second order term algebras. We illustrate the system by considering typed programs to reduce to normal form terms of the untyped lambda calculus, encoded as elements of a second order term algebra. First order encodings based on de Bruijn indexes are also considered. The examples also show that a version of the intersection type disciplines can be helpful in some cases to prove the existence of a canonical form. Finally we consider interpretations of our typed systems in the pure lambda calculus and a new gödelization of the pure lambda calculus. © Springer-Verlag Berlin Heidelberg 2001.

Provide Feedback

Have ideas for a new metric? Would you like to see something else here?Let us know