A completeness result for the simply typed -calculus
نویسندگان
چکیده
In this paper, we define a semantic of realizability for the simply typed λμcalculus. An adequation lemma is proved, it allows to give characterizations of the computational behavior of some closed typed terms through their types. We dealt also with the problem of completeness and prove a completeness result.
منابع مشابه
ar X iv : 0 90 5 . 03 57 v 1 [ m at h . L O ] 4 M ay 2 00 9 A completeness result for the simply typed λ μ - calculus
In this paper, we define a realizability semantics for the simply typed λµ-calculus. We show that if a term is typable, then it inhabits the interpretation of its type. This result serves to give characterizations of the computational behavior of some closed typed terms. We also prove a completeness result of our realizability semantics using a particular term model.
متن کاملCompleteness Results for Higher - Order Equational Logic submitted
We present several results concerning deductive completeness of the simply typed λcalculus with constants and equational axioms. First, we prove deductive completeness of the calculus with respect to standard semantics for axioms containing neither free nor bound occurrences of higher-order variables. Using this result, we analyze some fundamental deductive and semantic properties of axiomatic ...
متن کاملA revised completeness result for the simply typed λμ-calculus using realizability semantics
In this paper, we define a new realizability semantics for the simply typed λμ-calculus. We show that if a term is typable, then it inhabits the interpretation of its type. We also prove a completeness result of our realizability semantics using a particular term model. This paper corrects some errors in [21] by the first author and Saber.
متن کاملCompleteness of Conversion between Reactive Programs for Ultrametric Models
In 1970 Friedman proved completeness of beta eta conversion in the simply-typed lambda calculus for the set-theoretical model. Recently Krishnaswami and Benton have captured the essence of Hudak’s reactive programs in an extension of simply typed lambda calculus with causal streams and a temporal modality and provided this typed lambda calculus for reactive programs with a sound ultrametric sem...
متن کاملUnchecked Exceptions Can Be Strictly More Powerful Than Call/CC
We demonstrate that in the context of statically-typed purely-functional lambda calculi without recursion, unchecked exceptions (e.g., SML exceptions) can be strictly more powerful than call/cc. More precisely, we prove that a natural extension of the simply-typed lambda calculus with unchecked exceptions is strictly more powerful than all known sound extensions of Girard’s Fω (a superset of th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007