Abstract

We give an account of two-level languages in terms of indexed categories and universal properties well-known in the context of categorical logic. This account provides three important insights: establishes precise analogies between two-level languages and module languages, explains the two-level languages used in partial evaluation (see [7]) in terms of those used for code generation (see [16]), suggests extensions that should be valuable for type-specialization (see [9]) and shape-analysis (see [1]).

Citations

195	Type-directed partial evaluation - Danvy - 1998
165	A modal analysis of staged computation - Davies, Pfenning
90	A partial evaluator for the untyped lambda-calculus - Gomard, Jones - 1991
77	A temporal-logic approach to binding-time analysis - Davies - 1996
35	Polymorphic binding-time analysis - Henglein, Mossin - 1994
33	A self-applicable partial evaluator for the lambda calculus: correctness and pragmatics - Gomard - 1992
23	A category-theoretic account of program modules - Moggi - 1989
8	Two-Level Functional Languages. Number 34 - Nielson, Nielson - 1992
4	Typed intermediate languages for shape-analysis - Bell, Moggi - 1997
4	The discrete objects in the eective topos - Hyland, Robinson, et al. - 1990
4	Dependent sums express separation of binding times - Launchbury - 1989
3	Type specialization for the lambda calculus - Hughes - 1996
3	Multi-level lambda-calculi - Nielson - 1996