Realizability and Parametricty in Pure Type Systems
نویسندگان
چکیده
We describe a systematic method to build a logic from any programming language described as a Pure Type System (PTS). The formulas of this logic express properties about programs. We define a parametricity theory about programs and a realizability theory for the logic. The logic is expressive enough to internalize both theories. Thanks to the PTS setting, we abstract most idiosyncrasies specific to particular type theories. This confers generality to the results, and reveals parallels between parametricity and realizability.
منابع مشابه
Realizability and Parametricity in Pure Type Systems
We describe a systematic method to build a logic from any programming language described as a Pure Type System (PTS). The formulas of this logic express properties about programs. We define a parametricity theory about programs and a realizability theory for the logic. The logic is expressive enough to internalize both theories. Thanks to the PTS setting, we abstract most idiosyncrasies specifi...
متن کاملNormalization by realizability also evaluates
For those of us that generally live in the world of syntax, semantic proof techniques such as realizability or logical relations/parametricity sometimes feel like magic. Why do they work? At which point in the proof is “the real work” done? Bernardy and Lasson [4] express realizability and parametricity models as syntactic models – but the abstraction/adequacy theorems are still explained as me...
متن کاملCombinatorial realizability models of type theory
We introduce a new model construction for Martin-Löf intensional type theory, which is sound and complete for the 1-truncated version of the theory. The model formally combines, by gluing along the functor from the category of contexts to the category of groupoids, the syntactic model with a notion of realizability. As our main application, we use the model to analyse the syntactic groupoid ass...
متن کاملLearning based realizability for HA + EM1 and 1-Backtracking games: Soundness and completeness
We prove a soundness and completeness result for Aschieri and Berardi’s learning based realizability for Heyting Arithmetic plus Excluded Middle over semi-decidable statements with respect to 1-Backtracking Coquand game semantics. First, we prove that learning based realizability is sound with respect to 1Backtracking Coquand game semantics. In particular, any realizer of an implication-and-neg...
متن کاملLinear realizability and full completeness for typed lambda-calculi
We present the model construction technique called Linear Realizability. It consists in building a category of Partial Equivalence Relations over a Linear Combinatory Algebra. We illustrate how it can be used to provide models, which are fully complete for various typed λ-calculi. In particular, we focus on special Linear Combinatory Algebras of partial involutions, and we present PER models ov...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2010