Skip to search formSkip to main contentSkip to account menu

Operational semantics for multi-language programs

This paper abstracts away the low-level details of interoperability like garbage collection and representation coherence, and lets us focus on semantic properties like type-safety and observable equivalence, which sheds light on real multi-language systems and tools such as the JNI, SWIG, and Haskell's stable pointers.
View on ACM (opens in a new tab)

Parametric Polymorphism through Run-Time Sealing or, Theorems for Low, Low Prices!

This paper shows how to extend System F's parametricity guarantee to a Matthews-Findler-style multi-language system that combines System F with an untyped language by use of dynamic sealing and shows a scheme for implementing parametric higher-order contracts in anUntyped setting which corresponds to a translation given by Sumii and Pierce.
View via Publisher (opens in a new tab)

Automatically restructuring programs for the Web

This work presents an automated transformation that converts traditional interactive programs into standard CGI programs, which enables reuse of existing software development methodologies and an adaptation of existing programming environments supports the development of Web programs.
View on IEEE (opens in a new tab)

An operational semantics for Scheme

This paper presents an operational semantics for the core of Scheme, and contributes three novel modeling techniques for Felleisen Hieb-style rewriting semantics, suggesting that they would scale to complete models of other languages.
View via Publisher (opens in a new tab)

A Visual Environment for Developing Context-Sensitive Term Rewriting Systems

PLT Redex is an embedded domain-specific language that helps users interactively create and debug context-sensitive term-rewriting systems and discusses the experience using it in courses and developing an operational semantics for R5RS Scheme.
View via Publisher (opens in a new tab)

An operational semantics for R5RS Scheme

Automatically restructuring software for the web

Relationally-parametric polymorphic contracts

A form of inference that can often save programmers from having to explicitly instantiate many parametric contracts is presented, and several examples are presented that illustrate how this system mimics the feel and properties of parametric polymorphism in typed languages.
View on ACM (opens in a new tab)

Blame for all

We present a language that integrates statically and dynamically typed components, similar to the gradual types of Siek and Taha (2006), and extend it to incorporate parametric polymorphism. Our…
View on ACM (opens in a new tab)

Component Deployment with PLaneT You Want it Where

For the past two years we have been developing PLaneT, a package manager built into PLT Scheme’s module system that simplifies program development by doing away with the distinction between installed…
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)