Shrinking Reductions in SML.NET

Benton, Nick; Kennedy, Andrew; Lindley, Sam; Russo, Claudio

doi:10.1007/11431664_9

Cited by 15 publications

(10 citation statements)

References 8 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…transformation of unit*int values to int). We compare (a) the released version of SML.NET, implementing a monadic intermediate language (MIL) and functional-style simplification algorithm, (b) the Appel/Jimstyle graph representation adapted to MIL terms implemented by Lindley (Benton et al 2004a;Lindley 2005), and (c) the new graphbased CPS representation with union-find. Tests were run on a 3Ghz Pentium 4 PC with 1GB of RAM running Windows Vista.…”

Section: Performance Resultsmentioning

confidence: 99%

“…An earlier term-graph implementation by Lindley was for a monadic language and had worst-case O(n 2 ) behaviour due to commuting conversions (Benton et al 2004a;Lindley 2005). Shivers and Wand (2005) have proposed a rather different graph representation for lambda terms, with the goal of sharing subterms after β-reduction.…”

Section: Recursive Functionsmentioning

confidence: 98%

“…Unfortunately, the order in which conversions are applied is critical to the efficiency of simplification by reduction. Consider the following term in λmon: (Benton et al 2004a), in part (we believe) because of the need to perform commuting conversions.…”

Section: Comparison With a Monadic Languagementioning

confidence: 99%

See 2 more Smart Citations

Compiling with continuations, continued

Kennedy

2007

Proceedings of the 12th ACM SIGPLAN International Conference on Functional Programming

Self Cite

View full text Add to dashboard Cite

We present a series of CPS-based intermediate languages suitable for functional language compilation, arguing that they have practical benefits over direct-style languages based on A-normal form (ANF) or monads. Inlining of functions demonstrates the benefits most clearly: in ANF-based languages, inlining involves a renormalization step that rearranges let expressions and possibly introduces a new 'join point' function, and in monadic languages, commuting conversions must be applied; in contrast, inlining in our CPS language is a simple substitution of variables for variables.We present a contification transformation implemented by simple rewrites on the intermediate language. Exceptions are modelled using so-called 'double-barrelled' CPS. Subtyping on exception constructors then gives a very straightforward effect analysis for exceptions. We also show how a graph-based representation of CPS terms can be implemented extremely efficiently, with linear-time term simplification.

show abstract

Section: Performance Resultsmentioning

confidence: 99%

Section: Recursive Functionsmentioning

confidence: 98%

See 1 more Smart Citation

Compiling with continuations, continued

Kennedy

2007

Proceedings of the 12th ACM SIGPLAN International Conference on Functional Programming

Self Cite

View full text Add to dashboard Cite

show abstract

“…In our setting the reductions that their algorithms perform are 3 In fact their calculus is n-ary, as is the full version of MIL. The reductions rely on knowing the number of occurrences of a particular variable.…”

Section: Previous Workmentioning

confidence: 99%

“…SML.NET [3,4] is a compiler for Standard ML that targets the .NET Common Language Runtime [7]. Like most other compilers for functional languages (e.g.…”

Section: Introductionmentioning

confidence: 99%

Implementation and Application of Functional Languages

Benton¹,

Kennedy²,

Lindley³

et al. 2006

Lecture Notes in Computer Science

View full text Add to dashboard Cite

show abstract

Ghostbuster: A tool for simplifying and converting GADTs

Zakian¹,

McDonell²,

Cimini³

et al. 2018

J. Funct. Prog.

View full text Add to dashboard Cite

Generalized Algebraic Data Types, or simply GADTs, can encode non-trivial properties in the types of the constructors. Once such properties are encoded in a datatype, however, all code manipulating that datatype must provide proof that it maintains these properties in order to typecheck. In this paper, we take a step toward gradualizing these obligations. We introduce a tool, Ghostbuster, that produces simplified versions of GADTs which elide selected type parameters, thereby weakening the guarantees of the simplified datatype in exchange for reducing the obligations necessary to manipulate it. Like ornaments, these simplified datatypes preserve the recursive structure of the original, but unlike ornaments, we focus on information-preserving bidirectional transformations. Ghostbuster generates type-safe conversion functions between the original and simplified datatypes, which we prove are the identity function when composed. We evaluate a prototype tool for Haskell against thousands of GADTs found on the Hackage package database, generating simpler Haskell'98 datatypes and round-trip conversion functions between the two.

show abstract

Shrinking Reductions in SML.NET

Cited by 15 publications

References 8 publications

Compiling with continuations, continued

Compiling with continuations, continued

Implementation and Application of Functional Languages

Ghostbuster: A tool for simplifying and converting GADTs

Contact Info

Product

Resources

About