Space-efficient gradual ty**

D Herman, A Tomb, C Flanagan - Higher-Order and Symbolic …, 2010 - Springer
Gradual type systems offer a smooth continuum between static and dynamic ty** by
permitting the free mixture of typed and untyped code. The runtime systems for these …

Pycket: a tracing JIT for a functional language

S Bauman, CF Bolz, R Hirschfeld, V Kirilichev… - Proceedings of the 20th …, 2015 - dl.acm.org
We present Pycket, a high-performance tracing JIT compiler for Racket. Pycket supports a
wide variety of the sophisticated features in Racket such as contracts, continuations, classes …

Resugaring: Lifting evaluation sequences through syntactic sugar

J Pombrio, S Krishnamurthi - Proceedings of the 35th ACM SIGPLAN …, 2014 - dl.acm.org
Syntactic sugar is pervasive in language technology. It is used to shrink the size of a core
language; to define domain-specific languages; and even to let programmers extend their …

Constraining delimited control with contracts

A Takikawa, TS Strickland… - European Symposium on …, 2013 - Springer
Most programming languages provide abstractions for non-local control flow and access to
the stack by using continuations, coroutines, or generators. However, their unrestricted use …

Formulae-as-types for an involutive negation

G Munch-Maccagnoni - Proceedings of the Joint Meeting of the Twenty …, 2014 - dl.acm.org
Negation is not involutive in the λC calculus because it does not distinguish captured stacks
from continuations. We show that there is a formulae-as-types correspondence between the …

Supporting dynamic, third-party code customizations in JavaScript using aspects

BS Lerner, H Venter, D Grossman - ACM Sigplan Notices, 2010 - dl.acm.org
Web sites and web browsers have recently evolved into platforms on top of which entire
applications are delivered dynamically, mostly as JavaScript source code. This delivery …

[KÖNYV][B] Teaching and assessing programming language tracing

GL Nelson - 2021 - search.proquest.com
Learning to write programs is hard, but many fail to even learn basic program reading skills,
such as mentally tracing a program to predict its behavior. This dissertation argues a new …

[PDF][PDF] Interprocedural dependence analysis of higher-order programs via stack reachability

M Might, T Prabhu - Proceedings of the 2009 Workshop on Scheme and …, 2009 - Citeseer
We present a small-step abstract interpretation for the A-Normal Form λ-calculus (ANF). This
abstraction has been instrumented to find data-dependence conflicts for expressions and …

Implementing continuation marks in JavaScript

J Clements, A Sundaram… - Proceedings of the …, 2008 - digitalcommons.calpoly.edu
MzScheme's continuation marks provide a flexible mechanism for implementing a number of
useful language features and tools. We demonstrate the simplicity and utility of continuation …

[KÖNYV][B] Designing for Extensibility and Planning for Conflict: Experiments in Web-Browser Design

BS Lerner - 2011 - search.proquest.com
The past few years have seen a growing trend in application development toward" web
applications", a fuzzy category of programs that currently (but not necessarily) run within web …