62 search results - page 3 / 13 » Lightweight Family Polymorphism |
FOSSACS
2008
Springer
13 years 10 months ago
2008
Springer
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...
STOC
1996
ACM
14 years 21 days ago
1996
ACM
Abstract. Most phylogenetics literature and construction methods based upon characters presume monomorphism (one state per character per species), yet polymorphism (multiple states...
FOSSACS
2009
Springer
14 years 3 months ago
2009
Springer
Abstract. We present a realizability model for a call-by-value, higherorder programming language with parametric polymorphism, general first-class references, and recursive types....
CP
2010
Springer
13 years 7 months ago
2010
Springer
We study the expressibility problem: given a finite constraint language Γ on a finite domain and another relation R, can Γ express R? We prove, by an explicit family of example...
TPHOL
2008
IEEE
14 years 2 months ago
2008
IEEE
We introduce a lightweight approach for reasoning about programs involving imperative data structures using the proof assistant Isabelle/HOL. It is based on shallow embedding of pr...