Generating Code with Polymorphic let: A Ballad of Value Restriction, Copying and Sharing

Kiselyov, Oleg

doi:10.4204/eptcs.241.1

Cited by 6 publications

(4 citation statements)

References 25 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…An exception, by Kokaji and Kameyama [2011], involves a language with polymorphism and control effects; their primary concern is the interaction of the value restriction and staging. Another, by Kiselyov [2017], considers the tripartite interaction of polymorphism, cross-stage persistence and mutable cells.…”

Section: Related Workmentioning

confidence: 99%

Staging with class: a specification for typed template Haskell

Xie

Pickering²,

Löh³

et al. 2022

Proc. ACM Program. Lang.

View full text Add to dashboard Cite

Multi-stage programming using typed code quotation is an established technique for writing optimizing code generators with strong type-safety guarantees. Unfortunately, quotation in Haskell interacts poorly with type classes, making it difficult to write robust multi-stage programs. We study this unsound interaction and propose a resolution, staged type class constraints, which we formalize in a source calculus λ ⇒ that elaborates into an explicit core calculus F . We show type soundness of both calculi, establishing that well-typed, well-staged source programs always elaborate to well-typed, well-staged core programs, and prove beta and eta rules for code quotations. Our design allows programmers to incorporate type classes into multi-stage programs with confidence. Although motivated by Haskell, it is also suitable as a foundation for other languages that support both overloading and quotation.

show abstract

Section: Related Workmentioning

confidence: 99%

Staging with class: a specification for typed template Haskell

Xie

Pickering²,

Löh³

et al. 2022

Proc. ACM Program. Lang.

View full text Add to dashboard Cite

show abstract

“…Their calculus is presented without explicit type abstraction and application. There is no discussion about cross-stage type variable references or qualified types and their primary concern, similar to Kiselyov [2017] is the interaction of the value restriction and staging. Our calculus in contrast, as it models Haskell, does not contain any effects so we have concentrated on qualified types.…”

Section: Related Workmentioning

confidence: 99%

A Specification for Typed Template Haskell

Pickering¹,

Löh²,

Wu³

2021

Preprint

View full text Add to dashboard Cite

Multi-stage programming is a proven technique that provides predictable performance characteristics by controlling code generation. We propose a core semantics for Typed Template Haskell, an extension of Haskell that supports multi staged programming that interacts well with polymorphism and qualified types. Our semantics relates a declarative source language with qualified types to a core language based on the the polymorphic lambda calculus augmented with multi-stage constructs.CCS Concepts: • Software and its engineering → General programming languages; • Social and professional topics → History of programming languages.

show abstract

“…The main difference is that M OC is much more dynamic: quoted code does not have to be completely closed when produced and well-scopedeness is checked dynamically, just before running the quoted code. This allows very dynamic behaviors such as automatic insertion of let-bindings [Kiselyov 2015] and dynamically determining staged stream pipelines [Kiselyov et al 2017]. One difference is the choice of universes: E has two universes, client and server, which are distinct.…”

Section: Staged Meta-programmingmentioning

confidence: 99%

Eliom: A Core ML Language for Tierless Web Programming

Radanne

Vouillon

Balat

2016

Programming Languages and Systems

View full text Add to dashboard Cite

Tierless Web programming languages allow programmers to combine client-side and server-side programming in a single program. Programmers can then define components with both client and server parts and get flexible, efficient and typesafe client-server communications. However, the expressive client-server features found in most tierless languages are not necessarily compatible with functionalities found in many mainstream languages. In particular, we would like to benefit from type safety, an efficient execution, static compilation, modularity and separate compilation.In this paper, we propose E , an industrial-strength tierless functional Web programming language which extends OC with support for rich client/server interactions. It allows to build whole applications as a single distributed program, in which it is possible to define modular tierless libraries with both server and client behaviors and combine them effortlessly. E is the only language that combines type-safe and efficient client/server communications with a static compilation model that supports separate compilation and modularity. It also supports excellent integration with OC , allowing to transparently leverage its ecosystem.To achieve all these features, E borrows ideas not only from distributed programming languages, but also from meta-programming and modern module systems. We present the design of E , how it can be used in practice and its formalization; including its type system, semantics and compilation scheme. We show that this compilation scheme preserves typing and semantics, and that it supports separate compilation.This juggling of many different technologies does not only make programming more complicated, it also imposes strong constraints on code organization and prevents modularity. Let us consider the case where we want to add a comment widget to a website. This widget requires J S code for client interactions, for example a convenient editor. It also requires server code that will store and serve the comments and potentially some associated database queries. This code will thus be split in two codebases and up to three languages. Furthermore, in order to be properly integrated in the larger website, the internal communications between the client and server parts of the widget will be exposed to the rest of the program. All these programming constraints, which stem directly from the way Web programming is done currently, make it impossible to preserve abstraction and encapsulation for widgets who have both client and server aspects. This hinders safety and reusability of widgets by preventing programmers to create selfcontained independent libraries that have both client and server aspects.: A Language for Modular Tierless Web Programming :3programming often relies on numerous external libraries (for encryption, HTML, logging, . . . ). We wanted to leverage all the existing tools and libraries developed either in the O project or the larger OC ecosystem. The design of a Modular Tierless languageTo build such a language with suppo...

show abstract

Generating Code with Polymorphic let: A Ballad of Value Restriction, Copying and Sharing

Cited by 6 publications

References 25 publications

Staging with class: a specification for typed template Haskell

Staging with class: a specification for typed template Haskell

A Specification for Typed Template Haskell

Eliom: A Core ML Language for Tierless Web Programming

Contact Info

Product

Resources

About