Sciweavers

663 search results - page 2 / 133
» Checking Dependent Types Using Compiled Code
Sort
View
LCPC
2009
Springer
13 years 9 months ago
Enforcing Textual Alignment of Collectives Using Dynamic Checks
Abstract. Many parallel programs are written in a single-program, multipledata (SPMD) style, in which synchronization is provided using collective operations that all threads execu...
Amir Kamil, Katherine A. Yelick
POPL
1995
ACM
13 years 8 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
POPL
2005
ACM
14 years 5 months ago
Polymorphic bytecode: compositional compilation for Java-like languages
We define compositional compilation as the ability to typecheck source code fragments in isolation, generate corresponding binaries, and link together fragments whose mutual assum...
Davide Ancona, Ferruccio Damiani, Sophia Drossopou...
IFL
2003
Springer
167views Formal Methods» more  IFL 2003»
13 years 10 months ago
A Functional Shell That Dynamically Combines Compiled Code
Abstract. We present a new shell that provides the full basic functionality of a strongly typed lazy functional language, including overloading. The shell can be used for manipulat...
Arjen van Weelden, Rinus Plasmeijer
ITP
2010
172views Mathematics» more  ITP 2010»
13 years 9 months ago
Equations: A Dependent Pattern-Matching Compiler
Abstract. We present a compiler for definitions made by pattern matching on inductive families in the Coq system. It allows to write structured, recursive dependently-typed functi...
Matthieu Sozeau