Functor categories and two-level languages

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1378, Issue , 1998, Pages 211-225

  Moggi, E ^a  

^a UNIVERSITY OF GENOA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRA; ALGOL (PROGRAMMING LANGUAGE); COMPUTATION THEORY; SEMANTICS;

ALPHA-CONVERSION; DENOTATIONAL MODELS; DENOTATIONAL SEMANTICS; FUNCTOR CATEGORY; KRIPKE LOGICAL RELATIONS; LAMBDA ABSTRACTION; TECHNICAL LEVELS; TWO-LEVEL LANGUAGES;

MODELING LANGUAGES;

EID: 84947210885     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0053552     Document Type: Conference Paper

References (19)

1. M. Fiore, E. Moggi, and D Sangiorgi. A fuUy-abstract model for the pi-calculus. In 11th LICS Conference. IEEE, 1996.
2. K. Gomard and N. Jones. A partial evaluator for the untyped lambda calculus. J. of Func. Program., 1(1), 1991.
3. Carsten Krogh Gomard. Program Analysis Matters. PhD thesis, DIKU, November 1991. DIKU report 91/17.
4. K. Gomard. A self-applicable partial evaluator for the lambda calculus. ACM Trans, on Progr. Lang, and Systems, 14(2), 1992.
5. F. Henglein and C. Mossin. Polymorphic binding-time analysis. In D. Sanella, editor, ESOP’94, volume 788 of LNCS. Springer Verlag, 1994.
6. Neil D. Jones, Carsten K. Gomard, and Peter Sestoft. Partial Evaluation and Automatic Program Generation. Prentice Hall International, 1993.
7. F.W. Lawvere. Functorial semantics of algebraic theories. Proc. Nat. Acad. Sci. U.S.A., 50, 1963.
8. John C. Mitchell. Foundations of Programming Languages. The MIT Press, Cambridge, MA, 1996.
9. J. Mitchell and E. Moggi. Kripke-style models for typed lambda calculus. Journal of Pure and Applied Algebra, 51, 1991.
10. E. Moggi. Notions of computation and monads. Information and Computation, 93(1), 1991.
11. E. Moggi. A categorical account of two-level languages. In MFPS XIII, ENTCS. Elsevier, 1997.
12. E. Moggi. Metalanguages and applications. In Semantics and Logics of Computation, Publications of the Newton Institute. CUP, 1997.
13. A. Meyer and M. Wand. Continuation semantics in typed lambda calculus. In R. Parikh, editor, Logics of Programs ’85, volume 193 of LNCS. Springer Verlag, 1985.
14. F. Nielson and H.R. Nielson. Two-Level Functional Languages. Number 34 in Cambridge Tracts in Theoretical Computer Science. CUP, 1992.
15. F.J. Oles. Type algebras, functor categories and block structure. In M. Nivat and J.C. Reynolds, editors, Algebraic Methods in Semantics, 1985.
16. P.W. O’Hearn and R.D. Tennent. Semantics of local variables. In Applications of Categories in Computer Science, number 177 in L.M.S. Lecture Notes Series. CUP, 1992.
17. A.M. Pitts and I.D.B. Stark. Observable properties of higher order functions that dynamically create local names, or: What’s new? In Math. Found, of Comp. Sci. ’93, volume 711 of LNCS. Springer Verlag, 1993.
18. R.D. Tennent. Semantics of Programming Languages. Prentice Hall, 1991.
19. Mitchell Wand. Specifying the correctness of binding-time analysis. Journal of Functional Programming, 3(3):365-387, July 1993.