A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2015; you can also visit the original URL.
The file type is application/pdf.
Filters
Translation and optimization for a core calculus with exceptions
2008
Proceedings of the 2009 ACM SIGPLAN workshop on Partial evaluation and program manipulation - PEPM '09
Preserved Fulltext
The translation to the core calculus enables us to easily analyse and optimize the code, while not sacrificing the flexibility and rich characteristic of the source language. ...
Our goal is to design an intermediate, minimal but expressive, core calculus which can be easily analysed and manipulated, and to show that this calculus can handle major language features by translating ...
We also thank Luke Ong for his insightful comments on this work, including some suggestions for a set of clearer terminologies. ...
doi:10.1145/1480945.1480952
dblp:conf/pepm/DavidGC09
fatcat:7xbddluv5nb65advlbek73wkmq
Sequent calculus as a compiler intermediate language
2016
Proceedings of the 21st ACM SIGPLAN International Conference on Functional Programming - ICFP 2016
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2016; you can also visit the original URL.
The file type is application/pdf.
To explore this question we designed Sequent Core, a practically-oriented variant of sequent calculus, and used it to re-implement a substantial chunk of the Glasgow Haskell Compiler. ...
The λ-calculus is popular as an intermediate language for practical compilers. But in the world of logic it has a lesser-known twin, born at the same time, called the sequent calculus. ...
A definitional translation Luckily, we can leverage the relationship between natural deduction and sequent calculus [5] to come up with a definitional translation from Sequent Core to Core, as shown ...
doi:10.1145/2951913.2951931
dblp:conf/icfp/DownenMAJ16
fatcat:ava2wbawqfcjhcomtmruxexcki
Sequent calculus as a compiler intermediate language
2016
SIGPLAN notices
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2016; you can also visit the original URL.
The file type is application/pdf.
To explore this question we designed Sequent Core, a practically-oriented variant of sequent calculus, and used it to re-implement a substantial chunk of the Glasgow Haskell Compiler. ...
The λ-calculus is popular as an intermediate language for practical compilers. But in the world of logic it has a lesser-known twin, born at the same time, called the sequent calculus. ...
A definitional translation Luckily, we can leverage the relationship between natural deduction and sequent calculus [5] to come up with a definitional translation from Sequent Core to Core, as shown ...
doi:10.1145/3022670.2951931
fatcat:ygxjj7itwzeddmgxx7rjrzt5ke
Typed common intermediate format
2000
Software engineering notes
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2004; you can also visit the original URL.
The file type is application/pdf.
FLINT is based o n a predicative variant of the Girard-Reynolds polymorphic calculus F ! , extended with a very rich set of primitive types and functions. ...
With its single uni ed type system, FLINT serves as a great platform for reasoning about crosslanguage interoperations. ...
Availability A preliminary implementation of the FLINT intermediate language is now used by and released with the Standard ML of New Jersey SML NJ compiler. ...
doi:10.1145/340855.341019
fatcat:zyahrvhxp5gi5idacm5m4cdvji
Inlining as staged computation
2003
Journal of functional programming
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2015; you can also visit the original URL.
The file type is application/pdf.
Using a two-level lambda calculus as the intermediate language, we show how to model inlining as a staged computation while avoiding unnecessary code duplication. ...
The new framework allows us to define inlining annotations formally and to reason about their interactions with module code. ...
Acknowledgements We would like to thank the anonymous referees as well as Dominik Madon, Chris League, and Walid Taha for their comments and suggestions on an early version of this paper. ...
doi:10.1017/s0956796802004616
fatcat:zntlqdg27jbijdsxdjc5sbtpjm
A novel framework for synthesizing nested queries in SQL from business requirements language
2021
Turkish Journal of Computer and Mathematics Education
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is application/pdf.
This work proposes a framework for translating requirement statementsresulting inthe construction of nested Queries. ...
Translating statements resultingin'nested'queries havealways been a challenge and was not effectively handled. ...
For translating SQLs into Object Code and to perform subsequent optimization,Grust T and Scholl M. ...
doi:10.17762/turcomat.v12i2.2291
fatcat:shg4gwm65nhg5ikfy2rljxu5uy
Wyvern
2013
Proceedings of the 5th Workshop on MechAnisms for SPEcialization, Generalization and inHerItance - MASPEGHI '13
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2014; you can also visit the original URL.
The file type is application/pdf.
The design of Wyvern closely follows both historical and modern ideas about the essence of object-orientation, suggesting a new way to think about a minimal, practical, typed core language for objects. ...
We show how this foundational language can be translated to the typed lambda calculus via standard encodings. ...
The language is statically typed, and all elements of the language, except types, are first-class values. The lambda calculus core provides good support for functional programming. ...
doi:10.1145/2489828.2489830
fatcat:g3kicptupbhlnc4wxcywgm6ai4
River: an intermediate language for stream processing
2015
Software, Practice & Experience
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Brooklet is a core calculus for such stream-processing languages. It is designed to model any streaming language and to facilitate reasoning about language implementation. ...
This restriction facilitates using our calculus for proofs and optimizations. The complete Brooklet grammar appears in Figure 1 . ...
ACKNOWLEDGEMENTS We would like to thank John Field, Rodric Rabbah, and Martin Vechev for their feedback on earlier versions of this paper and Nagui Halim for his support of this project. ...
doi:10.1002/spe.2338
fatcat:lmcdizjiz5ggtcfjon2cudqsdm
Type directed compilation of row-typed algebraic effects
2017
SIGPLAN notices
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
In particular, we show how algebraic effects generalize over common constructs like exception handling, state, iterators and async-await. ...
Finally, we show an efficient compilation scheme to common runtime platforms (such as JavaScript, the JVM, or .NET) using a type directed selective CPS translation. ...
The rules translate explicitly typed core into a untyped lambda calculus. ...
doi:10.1145/3093333.3009872
fatcat:zsiubfvgizhcnixyty6rvy7ahq
Type directed compilation of row-typed algebraic effects
2017
Proceedings of the 44th ACM SIGPLAN Symposium on Principles of Programming Languages - POPL 2017
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
In particular, we show how algebraic effects generalize over common constructs like exception handling, state, iterators and async-await. ...
Finally, we show an efficient compilation scheme to common runtime platforms (such as JavaScript, the JVM, or .NET) using a type directed selective CPS translation. ...
The rules translate explicitly typed core into a untyped lambda calculus. ...
doi:10.1145/3009837.3009872
fatcat:ytps3xv3qzeblewdae474wkwoq
Lambda, the ultimate TA
2009
SIGPLAN notices
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2012; you can also visit the original URL.
The file type is application/pdf.
What's Next
• Our plans for this year:
• polish existing material
• experiment with ssreflect package
• consider replacing subtyping by references (and
maybe a stack machine)
• Contributions welcome ...
I also heard there was talk about this at a recent SIGPLAN meeting. Is the course in danger at your school?" From a recent email exchange with a textbook editor... ...
A Few More Tactics
Inductively Defined Relations
Optimization Automation At this point, we begin introducing some simple automation facilities. ...
doi:10.1145/1631687.1596552
fatcat:vlfaety3dzd7no2fmqpqjhjoym
Lambda, the ultimate TA
2009
Proceedings of the 14th ACM SIGPLAN international conference on Functional programming - ICFP '09
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2012; you can also visit the original URL.
The file type is application/pdf.
What's Next
• Our plans for this year:
• polish existing material
• experiment with ssreflect package
• consider replacing subtyping by references (and
maybe a stack machine)
• Contributions welcome ...
I also heard there was talk about this at a recent SIGPLAN meeting. Is the course in danger at your school?" From a recent email exchange with a textbook editor... ...
A Few More Tactics
Inductively Defined Relations
Optimization Automation At this point, we begin introducing some simple automation facilities. ...
doi:10.1145/1596550.1596552
dblp:conf/icfp/Pierce09
fatcat:guabi76j55gzhigsuspnckidei
Implicit Hitting Set Algorithms for Maximum Satisfiability Modulo Theories
[chapter]
2018
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
We also provide a unifying view of how optimization, propositional reasoning, and theory reasoning can be combined in a MaxSMT solver. ...
Solving optimization problems with SAT has a long tradition in the form of MaxSAT, which maximizes the weight of satisfied clauses in a propositional formula. ...
Acknowledgments This research has been supported by the Austrian Science Fund (FWF) under projects W1255-N23 and S11408-N23. ...
doi:10.1007/978-3-319-94205-6_10
fatcat:nn6vdhbg4zaa5aprxzwc64k65u
A zoom-declarative debugger for sequential Erlang programs
2015
Science of Computer Programming
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
In order to represent the erroneous computation, a semantic calculus for sequential Core Erlang programs is proposed. ...
The debugger takes the intermediate representation generated by Erlang systems, known as Core Erlang, and an initial error detected by the user, and locates an erroneous program function responsible for ...
Second, the Core Erlang structure could be modified by optimization tools, and thus a particular structure cannot be assumed. ...
doi:10.1016/j.scico.2015.06.011
fatcat:dj5b4oyywjds7elaiql3myrhaq
Static typing for a faulty lambda calculus
2006
Proceedings of the eleventh ACM SIGPLAN international conference on Functional programming - ICFP '06
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2006; you can also visit the original URL.
The file type is application/pdf.
To demonstrate that λzap can serve as an idealized typed intermediate language, we define a type-preserving translation from a standard simply-typed lambda calculus into λzap. ...
To ensure that programs maintain the proper invariants and use λzap primitives correctly, the paper defines a type system for the language. ...
A single-argument function in the lambda calculus with type T1 → T2 is translated into a function with a triple of arguments and a triple of results, each with different colors: 3[[T1]] → 3[[T2] ]. ...
doi:10.1145/1159803.1159809
dblp:conf/icfp/WalkerMLRA06
fatcat:7gpg2gm6lfcgbg7f5r7oykp7gu
« Previous
Showing results 1 — 15 out of 13,948 results