Richard Statman Gilles Dowek June 1, 1992 CMU-CS-92-152 School of Computer...  Home/Search
Context Related
| cmu.edu/anon/1992/CMUCS92152.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: cmu.edu/anon/1992/ (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We give a complete self-contained proof of Statman's finite completeness theorem and of a corollary of this theorem stating that the -definability conjecture implies the higher-order matching conjecture. (Update)
Context of citations to this paper: More
.... there are interesting cases where it is decidable [44] By contrast, the decidability of higher order matching is an open problem [36, 56] although the decidability of certain cases is known [46, 15, 16] The matcher used here avoids decidability problems by its...
Cited by: More
Translucent Procedures, Abstraction without Opacity - Rozas (1993) (Correct)
Active bibliography (related documents): More All
1.1: On Statman's Finite Completeness Theorem - Statman, Dowek (1992) (Correct)
0.3: The "Hardest" Natural Decidable Theory - Vorobyov (1997) (Correct)
0.2: Third-Order Matching in lambda->-Curry is Undecidable - Vorobyov (1997) (Correct)
Similar documents based on text: More All
0.2: Applications of Plotkin-terms: partitions and morphisms for .. - Statman, Barendregt (Correct)
0.2: Complexity of the Higher Order Matching - Wierzbicki (2000) (Correct)
0.1: New Lower Bounds for the Expressiveness and the Higher-Order.. - Vorobyov (1999) (Correct)
BibTeX entry: (Update)
Richard Statman and Gilles Dowek. On statman's finite completeness theorem. Technical Report CMU-CS-92-152, Carnegie Mellon University, June 1992. http://citeseer.ist.psu.edu/statman92statmans.html More
@misc{ statman92statmans,
author = "R. Statman and G. Dowek",
title = "On statman's finite completeness theorem",
text = "Richard Statman and Gilles Dowek. On statman's finite completeness theorem.
Technical Report CMU-CS-92-152, Carnegie Mellon University, June 1992.",
year = "1992",
url = "citeseer.ist.psu.edu/statman92statmans.html" }
Citations (may not include all citations):137 Introduction to Combinators and -Calculus (context) - Hindley, Seldin - 1986
86 Completeness in the Theory of Types (context) - Henkin - 1950
53 Lambda-Definability in the Full Type Hierarchy (context) - Plotkin - 1980
41 Equality Between Functionals (context) - Friedman - 1975
23 ese de Doctorat d (context) - Huet, Equations et al. - 1976
15 The Clausal Theory of Types (context) - Wolfram - 1989
13 Invariance and -definability (context) - Statman - 1982
8 Memorandum SAI-RM (context) - Plotkin, Logical - 1973
4 the Existence of Closed Terms in the Typed -calculus II: Tra.. (context) - Statman - 1981
2 Harvey Friedman 's Research on the Foundations of Mathematic.. (context) - Statman, Functionals - 1985
Documents on the same site (http://reports-archive.adm.cs.cmu.edu/anon/1992/): More
Programming with Inductive and Co-Inductive Types - Greiner (1992) (Correct)
A Papaperspective Factorization Method for Shape and Motion.. - Poelman, Kanade (1992) (Correct)
Analytica - An Experiment in Combining Theorem Proving and.. - Clarke, Zhao (1992) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC