J Is for JavaScript: A Direct-Style Correspondence between Algol-Like Languages and JavaScript Using First-Class Continuations

No abstract is available for this paper.

• Publication year

  2009

• Venue

  Domain-Specific Languages

• Publication date

  2009-07-02

• Fields of study

  Computer Science

• Identifiers
  DOI 10.1007/978-3-642-03034-5_1
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Scheme to JavaScript compilation

  2009cited by this paper
• Implementing Continuation Marks in Javascript

  2008influential reference
• Ruby: The Programming Language

  2008cited by this paper
• A Rational Deconstruction of Landin's SECD Machine with the J Operator

  2008cited by this paper
• On the Expressiveness and Complexity of ATL

  2007cited by this paper
• Constructing Induction Rules for Deductive Synthesis Proofs

  2006cited by this paper
• On the static and dynamic extents of delimited continuations

  2005cited by this paper
• Sur un Exemple de Patrick Greussay

  2004cited by this paper
• Selective Tail Call Elimination

  2003cited by this paper
• Comparing Control Constructs by Double-Barrelled CPS

  2002cited by this paper
• Tail call elimination on the Java Virtual Machine

  2001cited by this paper
• Locus Solum: From the rules of logic to the logic of rules

  2001cited by this paper
• Trampolined style

  1999cited by this paper
• Definitional Interpreters Revisited

  1998cited by this paper
• Histories of Discoveries of Continuations: Belles-Lettres with Equivocal Tenses

  1997cited by this paper
• The essence of functional programming (Invited talk)

  1997cited by this paper
• Imperative functional programming

  1993cited by this paper
• The next 700 formal language descriptions

  1993cited by this paper
• Partial evaluation and automatic program generation

  1993cited by this paper
• Lambda-calculus schemata

  1993cited by this paper
• The essence of functional programming

  1992cited by this paper
• No assembly required

  1992cited by this paper
• Notions of Computation and Monads

  1991cited by this paper
• Partial Evaluation of Pattern Matching in Strings

  1989cited by this paper
• Engines From Continuations

  1989cited by this paper
• Reification without evaluation

  1988cited by this paper
• Orbit: an optimizing compiler for scheme (with retrospective)

  1986cited by this paper
• Standard, Storeless Semantics for ALGOL-Style Block Structure and Call-by Name

  1986cited by this paper
• The Essence of Rum: A Theory of the Intensional and Extensional Aspects of Lisp-Type Computation,

  1985cited by this paper
• The essence of Rum: a theory of the intensional and extensional aspects of lisp-type computation

  1985cited by this paper
• An efficient environment allocation scheme in an interpreter for a lexically-scoped LISP

  1980cited by this paper
• Phantom Stacks: If You Look Too Hard, They Aren't There

  1980cited by this paper
• Rabbit: A Compiler for Scheme

  1978cited by this paper
• Fast Pattern Matching in Strings

  1977cited by this paper
• A Lambda-Calculus Model of Programming Languages - II. Jumps and Procedures

  1976cited by this paper
• A Lambda-Calculus Model of Programming Languages - I. Simple Constructs

  1976cited by this paper
• Recursive Programming Techniques

  1975cited by this paper
• Structured Programming with go to Statements

  1974cited by this paper
• Behavioral semantics of nonrecursive control structures

  1974cited by this paper
• Correctness of translations of programming languages: an algebraic approach

  1972cited by this paper
• Definitional Interpreters for Higher-Order Programming Languages

  1972cited by this paper
• Proving Algorithms by Tail Functions

  1971cited by this paper
• The next 700 programming languages

  1966cited by this paper
• Flow diagrams, turing machines and languages with only two formation rules

  1966cited by this paper
• Correspondence between ALGOL 60 and Church's Lambda-notation

  1965cited by this paper
• A Formal Description of a Subset of Algol

  1964cited by this paper
• Information processing 1962 : proceedings of IFIP Congress 62

  1963cited by this paper
• Design of a separable transition-diagram compiler

  1963cited by this paper
• Towards a Mathematical Science of Computation

  1962cited by this paper
• Recursive functions of symbolic expressions and their computation by machine, Part I

  1960cited by this paper
• Recursive Functions of Symbolic Expressions and their Computation by Machine

  1959cited by this paper

• Design and Implementation of Thread-Level Speculation in JavaScript Engines

  2014cites this paper
• Peter J. Landin (1930–2009)

  2009cites this paper
• Peter J. Landin (1930–2009)

  2009cites this paper