Sciweavers

105 search results - page 5 / 21
» A typed intermediate language for compiling multiple inherit...
Sort
View
APLAS
2006
ACM
14 years 1 months ago
Computational Secrecy by Typing for the Pi Calculus
We define and study a distributed cryptographic implementation for an asynchronous pi calculus. At the source level, we adapt simple type systems designed for establishing formal ...
Martín Abadi, Ricardo Corin, Cédric ...
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
TLDI
2003
ACM
108views Formal Methods» more  TLDI 2003»
14 years 21 days ago
Inferring annotated types for inter-procedural register allocation with constructor flattening
We introduce an annotated type system for a compiler intermediate language. The type system is designed to support inter-procedural register allocation and the representation of t...
Torben Amtoft, Robert Muller
JFP
2002
108views more  JFP 2002»
13 years 7 months ago
A calculus with polymorphic and polyvariant flow types
We present CIL , a typed -calculus which serves as the foundation for a typed intermediate language for optimizing compilers for higher-order polymorphic programming languages. Th...
J. B. Wells, Allyn Dimock, Robert Muller, Franklyn...
MEMOCODE
2010
IEEE
13 years 5 months ago
Compilation of imperative synchronous programs with refined clocks
To overcome over-synchronization in synchronous programs, we recently introduced clock refinement to our synchronous programming language Quartz. This extension basically allows p...
Mike Gemunde, Jens Brandt, Klaus Schneider