Download:
|
by Braslia D. F, Fairouz Kamareddine
http://www.cee.hw.ac.uk/~fairouz/papers/conference-publications/ppdp00.ps
Add To MetaCart
Abstract:
A unication method based on the se-style of explicit substitution is proposed. This method together with appropriate translations, provide a Higher Order Unication (HOU) procedure for the pure -calculus. Our method is in
uenced by the treatment introduced by Dowek, Hardin and Kirchner using the -style of explicit substitution. Correctness and completeness properties of the proposed se-unication method are shown and its advantages, inherited from the qualities of the se-calculus, are pointed out. Our method needs only one sort of objects: terms. And in contrast to the HOU approach based on the -calculus, it avoids the use of substitution objects. This makes our method closer to the syntax of the -calculus. Furthermore, detection of redices depends on the search for solutions of simple arithmetic constraints which makes our method more operational than the one based on the -style of explicit substitution.
Citations
|
738
|
A machine-oriented logic based on the resolution principle
– Robinson
- 1965
|
|
606
|
Term Rewriting and All That
– Baader, Nipkow
- 1998
|
|
334
|
Explicit substitutions
– Abadi, Cardelli, et al.
- 1991
|
|
183
|
The lambda calculus, its syntax and semantics. Revised edition edn
– Barendregt
- 1984
|
|
178
|
A unification algorithm for typed -calculus
– Huet
- 1975
|
|
156
|
Isabelle: The next 700 theorem provers
– Paulson
- 1990
|
|
117
|
Confluence properties of weak and strong calculi of explicit substitutions
– Curien, Hardin, et al.
- 1996
|
|
47
|
Unification via explicit substitutions: The case of higher-order patterns
– Dowek, Hardin, et al.
- 1996
|
|
47
|
The Implementation of ALF - a Proof Editor based on Martin-Löf’s Monomorphic Type Theory with Explicit Substitution
– Magnusson
- 1994
|
|
35
|
A representation of lambda terms suitable for operations on their intensions
– Nadathur, Wilson
- 1990
|
|
31
|
Extending a -calculus with Explicit Substitution which Preserves Strong Normalisation into a Con Calculus on Open Terms
– Kamareddine, Ros
- 1997
|
|
27
|
Higher-order Uni via Explicit Substitutions
– Dowek, Hardin, et al.
- 2000
|
|
25
|
A unification algorithm for second-order monadic terms
– Farmer
- 1988
|
|
24
|
Modeling sharing and recursion for weak reduction strategies using explicit substitution
– Benaissa, Lescanne, et al.
- 1996
|
|
23
|
A useful -notation
– Kamareddine, Nederpelt
- 1996
|
|
22
|
de Vrijer. Selected papers on Automath
– Nederpelt, Geuvers, et al.
- 1994
|
|
17
|
The undecidability of the second-order uni problem
– Goldfarb
- 1981
|
|
11
|
Contribution a l'etude des -calculs avec substitutions explicites
– Ros
- 1993
|
|
9
|
Implementation of Higher-Order Uni Based on Calculus of Explicit Substitutions
– Borovansky
- 1995
|
|
9
|
Relating the - and s-styles of explicit substitutions
– Kamareddine, Ros
- 2000
|
|
7
|
Proof-term synthesis on dependent-type systems via explicit substitutions
– Munoz
- 2001
|
|
7
|
Higher-Order Uni Revisited: Complete Sets of Transformations
– Snyder, Gallier
- 1989
|
|
5
|
Strategies for Simply-Typed Higher Order Uni via se-Style of Explicit Substitution
– Ayala-Rincon, Kamareddine
- 2000
|
|
4
|
Higher-order Equational Uni via Explicit Substitutions
– Kirchner, Ringeissen
- 1997
|
|
3
|
FUNCTIONAL PEARL Even Higher-Order Functions for Parsing or Why Would Anyone Ever Want to Use a Sixth-Order Function
– Okasaki
- 1999
|
|
3
|
Progress in Theoretical Computer Science
– Prehofer
- 1997
|
|
1
|
Higher Order Uni via s-Style of Explicit Substitution
– Ayala-Rincon, Kamareddine
- 1999
|
