Sciweavers

87 search results - page 11 / 18
» Generic record combinators with static type checking
Sort
View
CORR
2004
Springer
151views Education» more  CORR 2004»
13 years 7 months ago
Finite-Tree Analysis for Constraint Logic-Based Languages: The Complete Unabridged Version
Logic languages based on the theory of rational, possibly infinite, trees have much appeal in that rational trees allow for faster unification (due to the safe omission of the occ...
Roberto Bagnara, Roberta Gori, Patricia M. Hill, E...

Publication
226views
15 years 5 months ago
A Gentle Introduction to Multi-stage Programming
Multi-stage programming (MSP) is a paradigm for developing generic software that does not pay a runtime penalty for this generality. This is achieved through concise, carefully-des...
Walid Taha
PLDI
2009
ACM
14 years 2 months ago
Trace-based just-in-time type specialization for dynamic languages
Dynamic languages such as JavaScript are more difficult to compile than statically typed ones. Since no concrete type information is available, traditional compilers need to emit...
Andreas Gal, Brendan Eich, Mike Shaver, David Ande...
GPCE
2009
Springer
13 years 5 months ago
Generating safe template languages
Template languages are widely used within generative programming, because they provide intuitive means to generate software artefacts expressed in a specific object language. Howe...
Florian Heidenreich, Jendrik Johannes, Mirko Seife...
TGC
2005
Springer
14 years 29 days ago
Types for Security in a Mobile World
Our society is increasingly moving towards richer forms of information exchange where mobility of processes and devices plays a prominent role. This tendency has prompted the acade...
Adriana B. Compagnoni, Elsa L. Gunter