Sciweavers

1154 search results - page 4 / 231
» Implementing Typed Intermediate Languages
Sort
View
PODS
2005
ACM
99views Database» more  PODS 2005»
14 years 7 months ago
XML type checking with macro tree transducers
MSO logic on unranked trees has been identified as a convenient theoretical framework for reasoning about expressiveness and implementations of practical XML query languages. As a...
Sebastian Maneth, Alexandru Berlea, Thomas Perst, ...
CC
2002
Springer
131views System Software» more  CC 2002»
13 years 7 months ago
CIL: Intermediate Language and Tools for Analysis and Transformation of C Programs
Abstract. This paper describes the C Intermediate Language: a highlevel representation along with a set of tools that permit easy analysis and source-to-source transformation of C ...
George C. Necula, Scott McPeak, Shree Prakash Rahu...
MPC
2010
Springer
165views Mathematics» more  MPC 2010»
14 years 9 days ago
Dependently Typed Grammars
Parser combinators are a popular tool for designing parsers in functional programming languages. If such combinators generate an abstract representation of the grammar as an interm...
Kasper Brink, Stefan Holdermans, Andres Löh
POPL
1995
ACM
13 years 11 months ago
Compiling Polymorphism Using Intensional Type Analysis
Traditional techniques for implementing polymorphism use a universal representation for objects of unknown type. Often, this forces a compiler to use universal representations eve...
Robert Harper, J. Gregory Morrisett
ICFP
2000
ACM
13 years 11 months ago
Fully reflexive intensional type analysis
Compilers for polymorphic languages can use runtime type inspection to support advanced implementation techniques such as tagless garbage collection, polymorphic marshalling, and ...
Valery Trifonov, Bratin Saha, Zhong Shao