this paper to advocate the use of functor categories as a semantic foundation of higher-order abstract syntax (HOAS). By way of example, we will show how functor categories can be used for at least the following applications
A calculus for a fragment of category theory is presented. The types in the language denote categori...
Higher-order abstract syntax is a central representation technique in logical frameworks which maps ...
We develop some Higher-Order Abstract Syntax (HOAS) concepts and proof principles as a collection of...
howe@scs.carleton.ca Higher-Order Abstract Syntax, or HOAS, is a technique for using a higher-order ...
. Standard ML has a module system that allows one to define parametric modules, called functors. Fun...
We present a logical framework for reasoning on a very general class of languages featuring binding ...
Categorical semantics of type theories are often characterized asstructure-preserving functors. This...
AbstractThe aim of this paper is to present the notion of higher-dimensional syntax, which is a hier...
We investigate a framework for representing and reasoning about syntactic and semantic aspects of ty...
The emergent mathematical philosophy of categorification is reshaping our view of modern mathematics...
This collection of documents presents the Isabelle formalization of Higher-Order Abstract Syntax (HO...
We present a series of improvements to the Hybrid system, a formal theory implemented in Isabelle/HO...
syntax (HOAS) in representing formal systems. Although these systems seem su-perficially the same, t...
Higher-order logic (HOL) forms the basis of several popular interactive theorem provers. These follo...
SIGLETIB: RN 4237 (156) / FIZ - Fachinformationszzentrum Karlsruhe / TIB - Technische Informationsbi...
A calculus for a fragment of category theory is presented. The types in the language denote categori...
Higher-order abstract syntax is a central representation technique in logical frameworks which maps ...
We develop some Higher-Order Abstract Syntax (HOAS) concepts and proof principles as a collection of...
howe@scs.carleton.ca Higher-Order Abstract Syntax, or HOAS, is a technique for using a higher-order ...
. Standard ML has a module system that allows one to define parametric modules, called functors. Fun...
We present a logical framework for reasoning on a very general class of languages featuring binding ...
Categorical semantics of type theories are often characterized asstructure-preserving functors. This...
AbstractThe aim of this paper is to present the notion of higher-dimensional syntax, which is a hier...
We investigate a framework for representing and reasoning about syntactic and semantic aspects of ty...
The emergent mathematical philosophy of categorification is reshaping our view of modern mathematics...
This collection of documents presents the Isabelle formalization of Higher-Order Abstract Syntax (HO...
We present a series of improvements to the Hybrid system, a formal theory implemented in Isabelle/HO...
syntax (HOAS) in representing formal systems. Although these systems seem su-perficially the same, t...
Higher-order logic (HOL) forms the basis of several popular interactive theorem provers. These follo...
SIGLETIB: RN 4237 (156) / FIZ - Fachinformationszzentrum Karlsruhe / TIB - Technische Informationsbi...
A calculus for a fragment of category theory is presented. The types in the language denote categori...
Higher-order abstract syntax is a central representation technique in logical frameworks which maps ...
We develop some Higher-Order Abstract Syntax (HOAS) concepts and proof principles as a collection of...