D. Leivant. Typing and computational properties of lambda expressions. Theoret. Comput. Sci., 44(1):51--68, 1986. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
First 50 documents
On Automating The Extraction Of Programs From Proofs .. - Kamareddine, Monin, .. (2002) (Correct)
....the proof as program paradigm ensure some correctness of programs extracted from a proof of function totality and provides a logical framework for which the behaviour of programs can be analysed. Systems which exploit the proof as program paradigm include Second Order Functional Arithmetic AF2 [6,8] and Recursive Type Theory TTR [15] Both Email: fairouz cee.hw.ac.uk Email: monin irisa.fr Email: ayala mat.unb.br c 2002 Published by Elsevier Science B. V. AF2 and TTR use equations as algorithmic speci cations where the compilation phase corresponds to formal termination proofs of ....
D. Leivant. Typing and computational properties of lambda expression. Theoretical Computer Science, 44:51-68, 1986.
An Extension Of An Automated Termination Method Of Recursive .. - Kamareddine, Al. (Correct)
....this approach programs are coded by terms extracted from proofs of termination of functions de ned by a set of equations. The extraction is obtained by syntactical termination proofs in a formal deduction style exploiting the Curry Howard correspondence. The theory can be found for instance in [16, 18, 17, 25]. In this system, the user can specify data types and functions in an ML like syntax, but when compiling, a fully automated proof search strategy is used. The input of that search strategy is a speci cation of a function and the output is either a termination proof providing a term that compute ....
D. Leivant. Typing and computational properties of lambda expression. Theoretical Computer Science, 44:51-68, 1986.
Compositional Characterisations of λ-terms.. -.. (2003) (Correct)
....characterisations in terms of intersection type disciplines. The most significant case is that of strongly normalising terms. One of the original motivations for introducing intersection types in [25] was precisely that of achieving such a characterisation. Alternative characterisations appear in [21,4,20,17,3,18]. In [11] both normalising and persistently normalising terms had been characterised using intersection types. The type assignment system in [11] has also been discussed in [8] Closed terms were characterised in [19] The characterisations appearing in Theorem 3.2 strengthen and generalise all ....
D. Leivant. Typing and computational properties of lambda expressions. Theoret. Comput. Sci., 44(1):51--68, 1986.
Characterising Strong Normalisation for Explicit.. - van Bakel.. (2002) (Correct)
.... originated in [7] to overcome the limitations of Curry s type assignment system and to provide a characterisation of strongly normalising terms of the calculus [20] Since then, intersection type disciplines were used in a series of papers for characterising evaluation properties of terms [16, 15, 3, 4, 12, 2, 11, 9]. We are interested here in considering calculi of explicit substitutions, originated in [1] for improving implementation of the calculus. Actually, in the literature there are many different proposals of explicit substitution calculi [6, 5, 14, 21] These calculi are surely powerful tools for ....
D. Leivant. Typing and computational properties of lambda expressions. Theoret. Comput. Sci., 44(1):51--68, 1986.
A Modality for Recursion - Nakano (2000) (Correct)
....can easily check that K I(A) k 1 I(A) k for every k. It should also be noted that I(A) k = V whenever A is a variant; and therefore, the conditional if B is not a variant is redundant for the clause 2 of the definition of I(A B) The set K takes a rather technical role (cf. [21]) in this semantics, and is only used to show head normalizability of terms of certain types in the proofs of (2) and (3) of Theorem 3. It can usually be considered an empty set. The third condition for u 2 I(A B) k implies that we distinguish x: Mx from M unless M = y: N for some y ....
D. Leivant. Typing and computational properties of lambda expressions. Theoretical Computer Science, 44(1):51--68, 1986.
Compositional Characterizations of λ-terms.. -.. (2000) (Correct)
....a characterization in terms of intersection type disciplines. The most significant case is that of strongly normalizing terms. One of the original motivations for introducing intersection types in [21] was precisely that of achieving such a characterization. Alternative characterizations appear in [18, 5, 17, 14, 4, 15]. In [10] both normalizing and persistently normalizing terms had been characterized using intersection types. Closed terms were characterized in [16] The characterizations appearing in Theorem 1 strengthen and generalize all earlier results, since all mentioned papers consider only specific type ....
D. Leivant. Typing and computational properties of lambda expressions. Theoret. Comput. Sci., 44(1):51--68, 1986.
Compositional Characterisations of λ-terms.. -.. (2005) (Correct)
No context found.
D. Leivant. Typing and computational properties of lambda expressions. Theoret. Comput. Sci., 44(1):51--68, 1986.
A Linearization of the Lambda-Calculus and Consequences - Kfoury (1996) (Correct)
No context found.
Leivant, D., \Typing and Computational Properties of Lambda Expressions", Theoretical Computer Science, Vol 44, pp 51-68, 1986.
New Notions of Reduction and Non-Semantic Proofs of Strong.. - Kfoury, Wells (1995) (20 citations) (Correct)
No context found.
D. Leivant. Typing and computational properties of lambda expressions. Theoretical Comput. Sci., 44:51--68, 1986.
A Lambda Model Characterizing Computational Behaviours of.. - Dezani-Ciancaglini.. (Correct)
No context found.
Daniel Leivant. Typing and computational properties of lambda expressions. Theoret. Comput. Sci., 44(1):51--68, 1986.
A Linearization of the Lambda-Calculus and Consequences - Kfoury (2000) (Correct)
No context found.
Leivant, D., \Typing and Computational Properties of Lambda Expressions", Theoretical Computer Science, Vol 44, pp 51-68, 1986.
On Automating the Extraction of Programs from.. - Kamareddine, Monin.. (Correct)
No context found.
D. Leivant. Typing and computational properties of lambda expression. Theoretical Computer Science, 44:51--68, 1986.
A Linearization of the Lambda-Calculus and Consequences - Kfoury (1996) (Correct)
No context found.
Leivant, D., "Typing and Computational Properties of Lambda Expressions", Theoretical Computer Science,Vol 44, pp 51-68, 1986.
Intersection Types for Explicit Substitutions - Lengrand, Lescanne.. (2003) (Correct)
No context found.
D. Leivant. Typing and computational properties of lambda expressions. Theoretical Computer Science, 44(1):51--68, 1986.
Behavioural Inverse Limit λ-Models - Dezani-Ciancaglini, Ghilezan.. (2003) (Correct)
No context found.
D. Leivant. Typing and computational properties of lambda expressions. Theoret. Comput. Sci., 44(1):51--68, 1986.
What do Types Mean? - From Intrinsic to Extrinsic Semantics - Reynolds (2001) (Correct)
No context found.
Daniel Leivant. Typing and computational properties of lambda expressions. Theoretical Computer Science, 44(1):51--68, 1986.
The Meaning of Types - From Intrinsic to Extrinsic Semantics - Reynolds (2000) (Correct)
No context found.
Daniel Leivant. Typing and computational properties of lambda expressions. Theoretical Computer Science, 44(1):51--68, 1986.
A Linearization of the Lambda-Calculus and Consequences - Kfoury (2000) (Correct)
No context found.
Leivant, D., "Typing and Computational Properties of Lambda Expressions", Theoretical Computer Science, Vol 44, pp 51-68, 1986.
A Linearization of the Lambda-Calculus and Consequences - Kfoury (1996) (Correct)
No context found.
Leivant, D., "Typing and Computational Properties of Lambda Expressions", Theoretical Computer Science, Vol 44, pp 51-68, 1986.
On Automating the Extraction of Programs from.. - Kamareddine, Monin.. (Correct)
No context found.
D. Leivant. Typing and computational properties of lambda expression. Theoretical Computer Science, 44:51-68, 1986.
Two Behavioural Lambda Models - Dezani-Ciancaglini, Ghilezan (Correct)
No context found.
Daniel Leivant. Typing and computational properties of lambda expressions. Theoret. Comput. Sci., 44(1):51--68, 1986.
Lambda Models Characterizing Computational Behaviours of.. - Dezani-Ciancaglini.. (2001) (Correct)
No context found.
Daniel Leivant. Typing and computational properties of lambda expressions. Theoret. Comput. Sci., 44(1):51--68, 1986.
On Automating The Extraction Of Programs From Proofs .. - Kamareddine, Monin, .. (2002) (Correct)
No context found.
D. Leivant. Typing and computational properties of lambda expression. Theoretical Computer Science, 44:51-68, 1986.
Characterising Strong Normalisation for Explicit.. - van Bakel.. (2002) (Correct)
No context found.
D. Leivant. Typing and computational properties of lambda expressions. Theoretical Computer Science, 44(1):51--68, 1986.
Appendix 1: Product Types in F ! - In This Section (Correct)
No context found.
Leivant, D., Typing and Computational Properties of Lambda Expressions, Theoretical Computer Science 44, 1986, 51-68.
First 50 documents
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