• Summary
• Related Documents
  • Active Bibliography
  • Co-citation
• Version History

Popular Tags

Add a tag:

No tags have been applied to this document.

BibTeX | Add To MetaCart

@TECHREPORT{Danvy89afunctional,
    author = {Olivier Danvy and Andrzej Filinski},
    title = {A Functional Abstraction of Typed Contexts},
    institution = {},
    year = {1989}
}

Years of Citing Articles

Bookmarks

         

OpenURL

 

Abstract:

ion of Typed Contexts Olivier Danvy & Andrzej Filinski DIKU -- Computer Science Department, University of Copenhagen Universitetsparken 1, 2100 Copenhagen , Denmark uucp: danvy@diku.dk & andrzej@diku.dk Abstract This report investigates abstracting control with functions. This is achieved by defining continuations as functions abstracting lexically a delimited context [C[ ]] rather than dynamically an unlimited one C[ ], as it is usually the case. Because their co-domain is distinguished from the final domain of Answers, such continuations can be composed, and this contrasts with the simple exceptions of ML and Lisp and the unlimited first-class continuations of Scheme. Making these functional control abstractions first-class o#ers a new area in programming which this paper explores. The key points obtained here are: a denotational semantics for a simple, call-by-value, strongly typed expression language with higher-order functions and first-class continuations; its congruence with a ...

Citations