On the λY calculus

Annals of Pure and Applied Logic 130 (1-3):325-337 (2004)
  Copy   BIBTEX

Abstract

The λY calculus is the simply typed λ calculus augmented with the fixed point operators. We show three results about λY: the word problem is undecidable, weak normalisability is decidable, and higher type fixed point operators are not definable from fixed point operators at smaller types

Categories

Keywords

Reprint years

DOI

10.1016/j.apal.2004.04.004

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 100,448

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

Strong storage operators and data types.Karim Nour - 1995 - Archive for Mathematical Logic 34 (1):65-78.
The Weak Normalization of the Simply Typed λse-calculus.Ariel Arbiser, Fairouz Kamareddine & Alejandro Rios - 2007 - Logic Journal of the IGPL 15 (2):121-147.
The λ μ T -calculus.Herman Geuvers, Robbert Krebbers & James McKinna - 2013 - Annals of Pure and Applied Logic 164 (6):676-701.
Definable fixed points in modal and temporal logics — a survey.Sergey Mardaev - 2007 - Journal of Applied Non-Classical Logics 17 (3):317-346.
Fixed point logics.Anuj Dawar & Yuri Gurevich - 2002 - Bulletin of Symbolic Logic 8 (1):65-88.
Ordinals and ordinal functions representable in the simply typed lambda calculus.N. Danner - 1999 - Annals of Pure and Applied Logic 97 (1-3):179-201.
Storage operators and directed lambda-calculus.René David & Karim Nour - 1995 - Journal of Symbolic Logic 60 (4):1054-1086.
Spatial logic of tangled closure operators and modal mu-calculus.Robert Goldblatt & Ian Hodkinson - 2017 - Annals of Pure and Applied Logic 168 (5):1032-1090.
Classical logic, storage operators and second-order lambda-calculus.Jean-Louis Krivine - 1994 - Annals of Pure and Applied Logic 68 (1):53-78.
Intuitionistic Fixed Point Theories for Strictly Positive Operators.Christian Rüede & Thomas Strahm - 2002 - Mathematical Logic Quarterly 48 (2):195-202.

Analytics

Added to PP
2014-01-16

Downloads
20 (#1,027,456)

6 months
8 (#551,658)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

Edinburgh LCF: a mechanised logic of computation.Michael J. C. Gordon - 1979 - New York: Springer Verlag. Edited by R. Milner & Christopher P. Wadsworth.
Completeness, invariance and λ-definability.R. Statman - 1982 - Journal of Symbolic Logic 47 (1):17-26.

Add more references