HOL-λσ: an intentional first-order expression of higher-order logic

HOL-λσ: an intentional first-order expression of higher-order logic (1999)

Cached

Download Links

by Gilles Dowek , Thérèse Hardin , Claude Kirchner

Citations:

BibTeX

@MISC{Dowek99hol-λσ:an,
    author = {Gilles Dowek and Thérèse Hardin and Claude Kirchner},
    title = {HOL-λσ: an intentional first-order expression of higher-order logic},
    year = {1999}
}

Years of Citing Articles

Bookmark

OpenURL

Abstract

Citations

997	The Lambda Calculus, its Syntax and Semantics - Barendregt - 1984
728	A formulation of the simple theory of types - Church - 1940
359	Explicit Substitutions - Abadi, Cardelli, et al. - 1992
279	An Introduction to Mathematical Logic and Type Theory: To Truth Through Proof - Andrews - 1986
221	Interprétation fonctionnelle et élimination des coupures de l’arithmétique d’ordre supérieur. Thèse de Doctorat d’ État, Université de Paris VII - Girard - 1972
195	Une extension de l’interprétation de Gödel à l’analyse et son application à l’élimination des coupures dans l’analyse et la théorie des types - Girard - 1970
137	Completion of a set of rules modulo a set of equations - Jouannaud, Kirchner - 1986
126	Complete sets of reductions for some equational theories - Peterson, Stickel - 1981
118	Automated deduction by theory resolution - Stickel - 1985
114	Confluence properties of weak and strong calculi of explicit substitutions - Hardin - 1996
105	Building-in equational theories - Plotkin - 1972
95	Higher-order unification via explicit substitutions - Hardin, Kirchner
93	Resolution in type theory - Andrews - 1971
75	Combinatory reduction systems: introduction and survey - Klop, Oostrom, et al. - 1993
67	Tree-manipulating systems and Church-Rosser theorems - Rosen - 1973
51	Unification via explicit substitutions: The case of higher-order patterns - Dowek, Hardin, et al. - 1996
44	The Implementation of ALF: A Proof Editor Based on MartinLöf's Monomorphic Type Theory with Explicit Substitution - Magnusson - 1995
34	A mechanization of type theory - Huet - 1973
32	General Models, Descriptions, and Choice in Type Theory - Andrews - 1972
30	A representation of lambda terms suitable for operations on their intensions - Nadathur, Wilson - 1990
25	The Church-Rosser property and a result in combinatory logic - Hindley - 1964
25	A Compact Representation of Proofs - Miller - 1987
20	Theorem proving modulo. Rapport de Recherche 3400 - Dowek, Hardin, et al. - 1998
18	Normalised rewriting and normalised completion - Marché - 1994
15	Typed λ-calculi with explicit substitutions may not terminate - Melliès - 1995
14	Un calcul de substitutions pour la representation de preuves partielles en theorie de types - Munoz - 1997
13	Rewriting modulo a rewrite system - Viry - 1995
10	A compact representation of proofs. Studia Logica, 46(4):347–370, 1987. A Systematic Approach to Canonicity in the Classical Sequent Calculus 29 - Miller - 1991
9	Interpr#tation fonctionnelle et #limination des coupures dans l'arithm#tique d'ordre sup#rieur, Th#se de Doctorat d'#tat, Universit# de Paris VII - Girard - 1972
7	Proof normalization modulo. In Types for proofs and programs 98 - Dowek, Werner - 1999
6	Une extension de l'interpr#tation de G#del # l'analyse, et son application # l'#limination des coupures et # la th#orie des types - Girard - 1975
5	Proofs in higher order logic - Miller - 1983
5	Higher-Order Equational Unification via Explicit Substitutions - Kirchner, Ringeissen - 1997
4	Higher-order unication via explicit substitutions, extended abstract - Hardin, Kirchner - 1995
4	Proof normalization modulo. Rapport de Recherche 3542, INRIA - Dowek, Werner - 1998
4	A notation for lambda terms: A generalization of environments. Theoretical Computer Science - Nadathur, Wilson - 1998
3	Constrained Resolution: A Complete Method for Type Theory - Huet - 1972
3	The undecidability of unication in third order logic - Huet - 1973
2	A proof of weak termination of the simply-typed oe-calculus - Goubault-Larrecq - 1997
2	Higher-Order Equational Unication via Explicit Substitutions - Ringeissen - 1997
1	A left linear variant of oe - Muoz - 1997
1	A proof of weak termination of the simply-typed λσ-calculus - Goubault-Larrecq - 1997
1	A left linear variant of λσ - Muñoz - 1997