Sciweavers

122 search results - page 16 / 25
» Polymorphic variants in Haskell
Sort
View
ICFP
2008
ACM
14 years 8 months ago
Scala for generic programmers
Datatype-generic programming involves parametrization by the shape of data, in the form of type constructors such as `list of'. Most approaches to datatype-generic programmin...
Bruno C. D. S. Oliveira, Jeremy Gibbons
ICFP
2006
ACM
14 years 8 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...
TLDI
2003
ACM
134views Formal Methods» more  TLDI 2003»
14 years 1 months ago
Scrap your boilerplate: a practical design pattern for generic programming
We describe a design pattern for writing programs that traverse data structures built from rich mutually-recursive data types. Such programs often have a great deal of “boilerpl...
Ralf Lämmel, Simon L. Peyton Jones
LISP
2008
105views more  LISP 2008»
13 years 8 months ago
Proving operational termination of membership equational programs
Abstract Reasoning about the termination of equational programs in sophisticated equational languages such as ELAN, MAUDE, OBJ, CAFEOBJ, HASKELL, and so on, requires support for ad...
Francisco Durán, Salvador Lucas, Claude Mar...
DOCENG
2011
ACM
12 years 8 months ago
Interoperable metadata semantics with meta-metadata: a use case integrating search engines
A use case involving integrating results from search engines illustrates how the meta-metadata language facilitates interoperable metadata semantics. Formal semantics can be hard ...
Yin Qu, Andruid Kerne, Andrew M. Webb, Aaron Herst...