Sciweavers

99 search results - page 10 / 20
» Building Compilers by Combining Algebras
Sort
View
APLAS
2007
ACM
13 years 11 months ago
Finally Tagless, Partially Evaluated
We have built the first family of tagless interpretations for a higher-order typed object language in a typed metalanguage (Haskell or ML) that require no dependent types, general...
Jacques Carette, Oleg Kiselyov, Chung-chieh Shan
CALCO
2009
Springer
169views Mathematics» more  CALCO 2009»
14 years 2 months ago
Correctness, Completeness and Termination of Pattern-Based Model-to-Model Transformation
Abstract. Model-to-model (M2M) transformation consists in transforming models from a source to a target language. Many transformation languages exist, but few of them combine a dec...
Fernando Orejas, Esther Guerra, Juan de Lara, Hart...
OOPSLA
2001
Springer
13 years 12 months ago
The Java Syntactic Extender
The ability to extend a language with new syntactic forms is a powerful tool. A sufficiently flexible macro system allows programmers to build from a common base towards a langua...
Jonathan Bachrach, Keith Playford
JSW
2006
82views more  JSW 2006»
13 years 7 months ago
Incremental Implementation of Syntax Driven Logics
Abstract-- This paper describes a technique combining higher order functions, algebraic datatypes, and monads to incrementally implement syntax driven logics. Extensions can be com...
Ignatius Sri Wishnu Brata Prasetya, A. Azurat, Tan...
CGO
2010
IEEE
14 years 18 days ago
Lightweight feedback-directed cross-module optimization
Cross-module inter-procedural compiler optimization (IPO) and Feedback-Directed Optimization (FDO) are two important compiler techniques delivering solid performance gains. The co...
David Xinliang Li, Raksit Ashok, Robert Hundt