230 search results - page 10 / 46 » Automation for Dependently Typed Functional Programming |
LPAR
2001
Springer
14 years 2 days ago
2001
Springer
Several logic-based languages, such as Prolog II and its successors, SICStus Prolog and Oz, offer a computation domain including rational trees. Infinite rational trees allow fo...
CIE
2008
Springer
13 years 9 months ago
2008
Springer
Nested datatypes are families of datatypes that are indexed over all types and where the datatype constructors relate different members of the family. This may be used to represent...
FOSSACS
2008
Springer
13 years 9 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...
FROCOS
2005
Springer
14 years 1 months ago
2005
Springer
ATS is a language with a highly expressive type system that supports a restricted form of dependent types in which programs are not allowed to appear in type expressions. The langu...
LICS
2009
IEEE
14 years 2 months ago
2009
IEEE
—What is reachability in higher-order functional programs? We formulate reachability as a decision problem in the setting of the prototypical functional language PCF, and show th...