Sciweavers

119 search results - page 1 / 24
» Foundations for structured programming with GADTs
Sort
View
POPL
2008
ACM
14 years 11 months ago
Foundations for structured programming with GADTs
GADTs are at the cutting edge of functional programming and become more widely used every day. Nevertheless, the semantic foundations underlying GADTs are not well understood. In ...
Patricia Johann, Neil Ghani
TLDI
2010
ACM
218views Formal Methods» more  TLDI 2010»
14 years 8 months ago
Pointwise generalized algebraic data types
In the GADT (Generalized Algebraic Data Types) type system, a pattern-matching branch can draw type information from both the scrutinee type and the data constructor type. Even th...
Chuan-kai Lin, Tim Sheard
ICFP
2009
ACM
14 years 12 months ago
Complete and decidable type inference for GADTs
GADTs have proven to be an invaluable language extension, a.o. for ensuring data invariants and program correctness. Unfortunately, they pose a tough problem for type inference: w...
Tom Schrijvers, Simon L. Peyton Jones, Martin Sulz...
OOPSLA
2005
Springer
14 years 4 months ago
Generalized algebraic data types and object-oriented programming
Generalized algebraic data types (GADTs) have received much attention recently in the functional programming community. They generalize the (type) parameterized algebraic datatype...
Andrew Kennedy, Claudio V. Russo
ENTCS
2007
109views more  ENTCS 2007»
13 years 11 months ago
Free Theorems and Runtime Type Representations
’s abstraction theorem [21], often referred to as the parametricity theorem, can be used to derive properties about functional programs solely from their types. Unfortunately, i...
Dimitrios Vytiniotis, Stephanie Weirich