Sciweavers

61 search results - page 7 / 13
» The Essence of Program Transformation by Partial Evaluation ...
Sort
View
ICCL
1998
IEEE
14 years 1 days ago
Modular Compilers Based on Monad Transformers
The monadic style of language speci cation has the advantages of modularity and extensibility: it is simple to add or change features in an interpreter to re ect modi cations in t...
William L. Harrison, Samuel N. Kamin
POPL
2004
ACM
14 years 8 months ago
Simple relational correctness proofs for static analyses and program transformations
We show how some classical static analyses for imperative programs, and the optimizing transformations which they enable, may be expressed and proved correct using elementary logi...
Nick Benton
LISP
2008
105views more  LISP 2008»
13 years 7 months ago
Proving operational termination of membership equational programs
Abstract Reasoning about the termination of equational programs in sophisticated equational languages such as ELAN, MAUDE, OBJ, CAFEOBJ, HASKELL, and so on, requires support for ad...
Francisco Durán, Salvador Lucas, Claude Mar...
WWW
2004
ACM
14 years 8 months ago
Staging transformations for multimodal web interaction management
Multimodal interfaces are becoming increasingly ubiquitous with the advent of mobile devices, accessibility considerations, and novel software technologies that combine diverse in...
Michael Narayan, Christopher Williams, Saverio Per...
PEPM
2004
ACM
14 years 1 months ago
Proving termination of membership equational programs
Advanced typing, matching, and evaluation strategy features, as well as very general conditional rules, are routinely used in equational programming languages such as, for example...
Francisco Durán, Salvador Lucas, José...