Sciweavers

894 search results - page 32 / 179
» Typed Contracts for Functional Programming
Sort
View
ICFP
2002
ACM
14 years 8 months ago
A demand-driven adaptive type analysis
Compilers for dynamically and statically typed languages ensure safe execution by verifying that all operations are performed on appropriate values. An operation as simple as car ...
Danny Dubé, Marc Feeley
ICFP
2006
ACM
14 years 8 months ago
Context-parametric polykinded types
Generic Haskell is a language extension of Haskell for polytypic programming. Constrained types are parametric algebraic types with at least one argument constrained by type-class...
Pablo Nogueira
JCSS
2002
114views more  JCSS 2002»
13 years 8 months ago
Polymorphic Type Inference for the Relational Algebra
A database programming language is a programming language extended with database operations. In this paper we extend a core functional language with explicitly labeled tuples and ...
Jan Van den Bussche, Emmanuel Waller
FOSSACS
2008
Springer
13 years 10 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
1998
ACM
14 years 26 days ago
Local Type Inference
constraint solver. The other infers annotations on bound variables in function abstractions by propagating type constraints downward from enclosing application nodes. We motivate o...
Benjamin C. Pierce, David N. Turner