Relating models of backtracking

Wand, Mitchell; Vaillancourt, Dale

doi:10.1145/1016850.1016861

Cited by 21 publications

(15 citation statements)

References 14 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…• or an advanced feature relative to delimiting the continuation of the call to f, which actually is at the root of the functional approach to backtracking [1,64,69,258,315,350,363], an approach that is currently enjoying a renewal of interest [46,122,125,218,238,335,374] and is illustrated in Section 1.6.…”

Section: Beyond Cps Yes But How Much Really?mentioning

confidence: 99%

An Analytical Approach to Programs as Data Objects

Danvy¹

View full text Add to dashboard Cite

This essay accompanies a selection of 32 articles (referred to in bold face in the text and marked with " √ " in the bibliographic references) submitted to the University of Aarhus towards a Doctor Scientiarum degree in Computer Science. The author's previous academic degree, beyond a doctoral degree in June 1986, is an Habilitationà diriger les recherches from the Université Pierre et Marie Curie (Paris VI) in France; the corresponding material was submitted in September 1992 and the degree was obtained in January 1993. The present 32 articles have all been written since 1993 and while at DAIMI. Except for one other PhD student, all co-authors are or have been the author's students here in Aarhus. * Technical summaryThis work presents an analytical approach to programs as data objects, i.e., to programs whose representation is operated upon by other programs. The approach is analytical in that a variety of program manipulations is considered and their impact on program understanding, design, and efficiency is measured.Most of the programs considered here are language processors, i.e., programs interpreting, translating, or transforming other programs. As for the program manipulations, they concern block structure and lexical scope, the representation of functions at run time, and the representation of control.ii Teknisk résuméDette arbejde praesenterer en analytisk tilgang til programmer som dataobjekter, dvs, til programmer hvis repraesentation bliver behandlet af andre programmer. Tilgangen er analytisk i og med at et udvalg af programmanipulationer bliver betragtet og deres indflydelse på program-forståelse, -design og -effektivitet bliver vurderet.De fleste programmer, der betragtes her, er sprogbehandlingsprogrammer, dvs, programmer der fortolker, oversaetter eller transformerer andre programmer. Hvad angår programmanipulationerne, vedrører de blokstruktur og leksikalsk virkefelt, repraesentation af funktioner på køretidspunktet og repraesentation af kontrol.iii

show abstract

Section: Beyond Cps Yes But How Much Really?mentioning

confidence: 99%

An Analytical Approach to Programs as Data Objects

Danvy¹

View full text Add to dashboard Cite

show abstract

“…A well-known model for Prolog-style backtracking is the two-continuation model [23,24]. Although this model requires multi-shot continuations, it is not difficult to adapt it to coroutines that are equivalent to one-shot continuations [25,6].…”

Section: Goal-oriented Programmingmentioning

confidence: 99%

Programming with Multiple Paradigms in Lua

Ierusalimschy

2010

Functional and Constraint Logic Programming

View full text Add to dashboard Cite

Abstract. Lua is a scripting language used in many industrial applications, with an emphasis on embedded systems and games. Two key points in the design of the language that led to its widely adoption are flexibility and small size. To achieve these two conflicting goals, the design emphasizes the use of few but powerful mechanisms, such as first-class functions, associative arrays, coroutines, and reflexive capabilities. As a consequence of this design, although Lua is primarily a procedural language, it is frequently used in several different programming paradigms, such as functional, object-oriented, goal-oriented, and concurrent programming, and also for data description. In this paper we discuss what mechanisms Lua features to achieve its flexibility and how programmers use them for different paradigms.

show abstract

“…More precisely, if the trees are finite, then exploring them fully (by applying explore None) yields identical results. For infinite trees, which too can be represented by the type 'a pV, characterizing equivalence is trickier [49].…”

Section: Search-tree Monadmentioning

confidence: 99%

Embedded Probabilistic Programming

Kiselyov¹,

Shan

2009

Domain-Specific Languages

View full text Add to dashboard Cite

Abstract. Two general techniques for implementing a domain-specific language (DSL) with less overhead are the finally-tagless embedding of object programs and the direct-style representation of side effects. We use these techniques to build a DSL for probabilistic programming, for expressing countable probabilistic models and performing exact inference and importance sampling on them. Our language is embedded as an ordinary OCaml library and represents probability distributions as ordinary OCaml programs. We use delimited continuations to reify probabilistic programs as lazy search trees, which inference algorithms may traverse without imposing any interpretive overhead on deterministic parts of a model. We thus take advantage of the existing OCaml implementation to achieve competitive performance and ease of use. Inference algorithms can easily be embedded in probabilistic programs themselves.

show abstract

Relating models of backtracking

Cited by 21 publications

References 14 publications

An Analytical Approach to Programs as Data Objects

An Analytical Approach to Programs as Data Objects

Programming with Multiple Paradigms in Lua

Embedded Probabilistic Programming

Contact Info

Product

Resources

About