- New
-
Topics
- All Categories
- Metaphysics and Epistemology
- Value Theory
- Science, Logic, and Mathematics
- Science, Logic, and Mathematics
- Logic and Philosophy of Logic
- Philosophy of Biology
- Philosophy of Cognitive Science
- Philosophy of Computing and Information
- Philosophy of Mathematics
- Philosophy of Physical Science
- Philosophy of Social Science
- Philosophy of Probability
- General Philosophy of Science
- Philosophy of Science, Misc
- History of Western Philosophy
- Philosophical Traditions
- Philosophy, Misc
- Other Academic Areas
- Journals
- Submit material
- More
Strong Reduction of Combinatory Calculus with Streams
Studia Logica 103 (2):375-387 (2015)
Abstract
This paper gives the strong reduction of the combinatory calculus SCL, which was introduced as a combinatory calculus corresponding to the untyped Lambda-mu calculus. It proves the confluence of the strong reduction. By the confluence, it also proves the conservativity of the extensional equality of SCL over the combinatory calculus CL, and the consistency of SCLMy notes
Similar books and articles
A solution to Curry and Hindley’s problem on combinatory strong reduction.Pierluigi Minari - 2009 - Archive for Mathematical Logic 48 (2):159-184.
Non deterministic classical logic: the $lambdamu^{++}$-calculus.Karim Nour - 2002 - Mathematical Logic Quarterly 48 (3):357-366.
Introduction to Combinators and (Lambda) Calculus.J. Roger Hindley - 1986 - New York: Cambridge University Press. Edited by J. P. Seldin.
Compact bracket abstraction in combinatory logic.Sabine Broda & Luís Damas - 1997 - Journal of Symbolic Logic 62 (3):729-740.
Light affine lambda calculus and polynomial time strong normalization.Kazushige Terui - 2007 - Archive for Mathematical Logic 46 (3-4):253-280.
Diagonal fixed points in algebraic recursion theory.Jordan Zashev - 2005 - Archive for Mathematical Logic 44 (8):973-994.
Systems of illative combinatory logic complete for first-order propositional and predicate calculus.Henk Barendregt, Martin Bunder & Wil Dekkers - 1993 - Journal of Symbolic Logic 58 (3):769-788.
NP-Completeness of a Combinator Optimization Problem.M. S. Joy & V. J. Rayward-Smith - 1995 - Notre Dame Journal of Formal Logic 36 (2):319-335.
Remarks on the church-Rosser property.E. G. K. López-Escobar - 1990 - Journal of Symbolic Logic 55 (1):106-112.
Completeness of two systems of illative combinatory logic for first-order propositional and predicate calculus.Wil Dekkers, Martin Bunder & Henk Barendregt - 1998 - Archive for Mathematical Logic 37 (5-6):327-341.
Lambda-calculus, combinators, and functional programming.György E. Révész - 1988 - New York: Cambridge University Press.
Analytics
Added to PP
2014-08-17
Downloads
23 (#664,515)
6 months
4 (#790,687)
2014-08-17
Downloads
23 (#664,515)
6 months
4 (#790,687)
Historical graph of downloads
References found in this work
A Simplified Proof of the Church–Rosser Theorem.Yuichi Komori, Naosuke Matsuda & Fumika Yamakawa - 2014 - Studia Logica 102 (1):175-183.
A solution to Curry and Hindley’s problem on combinatory strong reduction.Pierluigi Minari - 2009 - Archive for Mathematical Logic 48 (2):159-184.
PhilPapers logo by Andrea Andrews and Meghan Driscoll.
This site uses cookies and Google Analytics (see our terms & conditions for details regarding the privacy implications). Use of this site is subject to terms & conditions.
All rights reserved by The PhilPapers Foundation
Server: philpapers-web-7c76586df8-4c2ch uwo