A Generalisation of Pre-logical Predicates to Simply Typed Formal Systems
نویسنده
چکیده
We generalise the notion of pre-logical predicates [HS02] to arbitrary simply typed formal systems and their categorical models. We establish the basic lemma of pre-logical predicates and composability of binary pre-logical relations in this generalised setting. This generalisation takes place in a categorical framework for typed higher-order abstract syntax and semantics [Fio02,MS03].
منابع مشابه
A generalisation of pre-logical predicates and its applications
This thesis proposes a generalisation of pre-logical predicates to simply typed formal systems and their categorical models. We analyse the three elements involved in pre-logical predicates — syntax, semantics and predicates — within a categorical framework for typed binding syntax and semantics. We then formulate generalised pre-logical predicates and show two distinguishing properties: a) equ...
متن کاملUnder Consideration for Publication in J. Functional Programming Girard Translation and Logical Predicates
We present a short proof of a folklore result: the Girard translation from the simply typed lambda calculus to the linear lambda calculus is fully complete. The proof makes use of a notion of logical predicates for intuitionistic linear logic. While the main result is of independent interest, this paper can be read as a tutorial on this proof technique for reasoning about relations between type...
متن کاملSemantic and Syntactic Approaches to Simulation Relations
Simulation relations are tools for establishing the correctness of data refinement steps. In the simply-typed lambda calculus, logical relations are the standard choice for simulation relations, but they suffer from certain shortcomings; these are resolved by use of the weaker notion of pre-logical relations instead. Developed from a syntactic setting, abstraction barrier-observing simulation r...
متن کاملTyped Graph Theory Extending graphs with type systems
In this paper, we propose typed graph theory, a generalisation of graph theory by extending graphs with type systems. Type theory, as a study of type systems, was originally developed as a formal system in logics. In the proposed typed graph theory, every vertex has a type and operations are restricted to vertices of a certain type. We revisit core concepts in graph theory, where new interestin...
متن کاملSimple Parsimonious Types and Logarithmic Space
We present a functional characterization of deterministic logspace-computable predicates based on a variant (although not a subsystem) of propositional linear logic, which we call parsimonious logic. The resulting calculus is simply-typed and contains no primitive besides those provided by the underlying logical system, which makes it one of the simplest higher-order languages capturing logspac...
متن کامل