Declarative continuations: An investigation of duality in programming language semantics

  • Andrzej Filinski
Conference paper

DOI: 10.1007/BFb0018355

Part of the Lecture Notes in Computer Science book series (LNCS, volume 389)
Cite this paper as:
Filinski A. (1989) Declarative continuations: An investigation of duality in programming language semantics. In: Pitt D.H., Rydeheard D.E., Dybjer P., Pitts A.M., Poigné A. (eds) Category Theory and Computer Science. Lecture Notes in Computer Science, vol 389. Springer, Berlin, Heidelberg

Abstract

This paper presents a formalism for including first-class continuations in a programming language as a declarative concept, rather than an imperative one. A symmetric extension of the typed λ-calculus is introduced, where values and continuations play dual roles, permitting mirror-image syntax for dual categorical concepts like products and coproducts. An implementable semantic description and a static type system for this calculus are presented. We also give a categorical description of the language, by presenting a correspondence with a system of combinatory logic, similar to a cartesian closed category, but with a completely symmetrical set of axioms.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag 1989

Authors and Affiliations

  • Andrzej Filinski
    • 1
  1. 1.DIKU — Computer Science DepartmentUniversity of CopenhagenCopenhagen ØDenmark

Personalised recommendations