Annals of Pure and Applied Logic 136 (1):75-90 (2005)

Abstract
We introduce a system of simply typed lambda terms and show that a rather comprehensive class of recursion equations on streams or non-wellfounded trees can be solved in our system. Moreover certain conditions are presented which guarantee that the defined functionals are primitive recursive. As a major example we give a co-recursive treatment of Mints’ continuous cut-elimination operator
Keywords No keywords specified (fix it)
Categories (categorize this paper)
DOI 10.1016/j.apal.2005.05.006
Options
Edit this record
Mark as duplicate
Export citation
Find it on Scholar
Request removal from index
Revision history

Download options

PhilArchive copy


Upload a copy of this paper     Check publisher's policy     Papers currently archived: 51,707
Through your library

References found in this work BETA

No references found.

Add more references

Citations of this work BETA

No citations found.

Add more citations

Similar books and articles

0-1 Laws for Recursive Structures.E. Grädel & A. Malmström - 1999 - Archive for Mathematical Logic 38 (4-5):205-215.
Recursion Theory and the Lambda-Calculus.Robert E. Byerly - 1982 - Journal of Symbolic Logic 47 (1):67-83.
Valuation Semantics for Intuitionic Propositional Calculus and Some of its Subcalculi.Andréa Loparić - 2010 - Principia: An International Journal of Epistemology 14 (1):125-33.
Recursive Distributed Representations.Jordan B. Pollack - 1990 - Artificial Intelligence 46:77-105.
Exact Bounds for Lengths of Reductions in Typed Λ-Calculus.Arnold Beckmann - 2001 - Journal of Symbolic Logic 66 (3):1277-1285.

Analytics

Added to PP index
2013-10-30

Total views
10 ( #805,230 of 2,333,191 )

Recent downloads (6 months)
1 ( #587,885 of 2,333,191 )

How can I increase my downloads?

Downloads

My notes