Sciweavers

1626 search results - page 56 / 326
» Subtyping with Power Types
Sort
View
137
Voted
POPL
1995
ACM
15 years 7 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
119
Voted
ICFP
2006
ACM
16 years 3 months ago
Simple unification-based type inference for GADTs
Generalized algebraic data types (GADTs), sometimes known as "guarded recursive data types" or "first-class phantom types", are a simple but powerful generaliz...
Simon L. Peyton Jones, Dimitrios Vytiniotis, Steph...
225
Voted
POPL
2005
ACM
16 years 3 months ago
Associated types with class
Haskell's type classes allow ad-hoc overloading, or typeindexing, of functions. A natural generalisation is to allow type-indexing of data types as well. It turns out that th...
Manuel M. T. Chakravarty, Gabriele Keller, Simon L...
136
Voted
CORR
2010
Springer
151views Education» more  CORR 2010»
15 years 3 months ago
Redundancies in Dependently Typed Lambda Calculi and Their Relevance to Proof Search
Dependently typed -calculi such as the Logical Framework (LF) are capable of representing relationships between terms through types. By exploiting the "formulas-as-types"...
Zachary Snow, David Baelde, Gopalan Nadathur
KBSE
2009
IEEE
15 years 10 months ago
Static Typing for Ruby on Rails
—Ruby on Rails (or just “Rails”) is a popular web application framework built on top of Ruby, an objectoriented scripting language. While Ruby’s powerful features such as d...
Jong-hoon (David) An, Avik Chaudhuri, Jeffrey S. F...