Sciweavers

1154 search results - page 32 / 231
» Implementing Typed Intermediate Languages
Sort
View
HASKELL
2007
ACM
13 years 11 months ago
A type-preserving closure conversion in haskell
The use of typed intermediate languages can significantly increase the reliability of a compiler. By type-checking the code produced at each transformation stage, one can identify...
Louis-Julien Guillemette, Stefan Monnier
IFL
2007
Springer
158views Formal Methods» more  IFL 2007»
14 years 1 months ago
Checking Dependent Types Using Compiled Code
Abstract. Type checkers for dependent types need to evaluate user defined functions during type checking. For this, current implementations typically use an interpreter, which has...
Dirk Kleeblatt
SOSL
1993
13 years 11 months ago
Verifying Process Algebra Proofs in Type Theory
In this paper we study automatic veri cation of proofs in process algebra. Formulas of process algebra are represented by types in typed -calculus. Inhabitants (terms) of these ty...
M. P. A. Sellink
ESOP
1999
Springer
13 years 12 months ago
Types and Subtypes for Client-Server Interactions
We define an extension of the π-calculus with a static type system which supports high-level specifications of extended patterns of communication, such as client-server protocol...
Simon J. Gay, Malcolm Hole
COMPSAC
2009
IEEE
13 years 11 months ago
Cartesian Programming: The TransLucid Programming Language
Abstract. The TransLucid programming language is a low-level intensional language, designed to be sufficiently rich for it to be the target language for translating the common prog...
John Plaice, Blanca Mancilla