Sciweavers

1982 search results - page 3 / 397
» Parametricity and dependent types
Sort
View
FOSSACS
2008
Springer
13 years 11 months ago
Erasure and Polymorphism in Pure Type Systems
We introduce Erasure Pure Type Systems, an extension to Pure Type Systems with an erasure semantics centered around a type constructor indicating parametric polymorphism. The eras...
Nathan Mishra-Linger, Tim Sheard
POPL
1997
ACM
14 years 2 months ago
First-class Polymorphism with Type Inference
Languages like ML and Haskell encourage the view of values as first-class entities that can be passed as arguments or results of functions, or stored as components of data struct...
Mark P. Jones
BIRTHDAY
2010
Springer
13 years 10 months ago
Programming Inductive Proofs - A New Approach Based on Contextual Types
In this paper, we present an overview to programming with proofs in the reasoning framework, Beluga. Beluga supports the specification of formal systems given by axioms and inferen...
Brigitte Pientka
PADL
2004
Springer
14 years 3 months ago
Parametric Fortran - A Program Generator for Customized Generic Fortran Extensions
We describe the design and implementation of a program generator that can produce extensions of Fortran that are specialized to support the programming of particular applications. ...
Martin Erwig, Zhe Fu
CALCO
2005
Springer
75views Mathematics» more  CALCO 2005»
14 years 3 months ago
Parametrized Exceptions
Following the paradigm of encapsulation of side effects via monads, the Java execution mechanism has been described by the socalled Java monad, encorporating essentially stateful ...
Dennis Walter, Lutz Schröder, Till Mossakowsk...