Extended Initiality for Typed Abstract Syntax
نویسندگان
چکیده
منابع مشابه
Extended Initiality for Typed Abstract Syntax
Initial Semantics aims at interpreting the syntax associated to a signature as the initial object of some category of “models”, yielding induction and recursion principles for abstract syntax. Zsidó [Zsi10, Chap. 6] proves an initiality result for simply–typed syntax: given a signature S, the abstract syntax associated to S constitutes the initial object in a category of models of S in monads. ...
متن کاملInitiality for Typed Syntax and Semantics
We give an algebraic characterization of the syntax and semantics of a class of simply–typed languages, such as the language PCF: we characterize simply–typed binding syntax equipped with reduction rules via a universal property, namely as the initial object of some category. For this purpose, we employ techniques developed in two previous works: in [2], we model syntactic translations between ...
متن کاملBenedikt Ahrens: Initiality for Typed Syntax and Semantics
We give an algebraic characterization of the syntax and semantics of a class of simply–typed languages, such as the language PCF: we characterize simply–typed binding syntax equipped with reduction rules via a universal property, namely as the initial object of some category. For this purpose, we employ techniques developed in two previous works: in [2], we model syntactic translations between ...
متن کاملAbstract Initiality
initiality Lutz Schröder, Horst Herrlich Abstract. We study morphisms that are initial w.r.t. all functors in a given conglomerate. Several results and counterexamples are obtained concerning the relation of such properties to different notions of subobject. E.g., strong monomorphisms are initial w.r.t. all faithful adjoint functors, but not necessarily w.r.t. all faithful monomorphism-preservi...
متن کاملNormalization by evaluation with typed abstract syntax
We present a simple way to implement typed abstract syntax for the lambda calculus in Haskell, using phantom types, and we specify normalization by evaluation (i.e., type-directed partial evaluation) to yield this typed abstract syntax. Proving that normalization by evaluation preserves types and yields normal forms then reduces to type-checking the specification.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Logical Methods in Computer Science
سال: 2012
ISSN: 1860-5974
DOI: 10.2168/lmcs-8(2:1)2012