230 search results - page 9 / 46 » Automation for Dependently Typed Functional Programming |
HASKELL
2006
ACM
14 years 1 months ago
2006
ACM
Haskell’s type system with multi-parameter constructor classes and functional dependencies allows static (compile-time) computations to be expressed by logic programming on the ...
MSCS
2008
13 years 7 months ago
2008
The idea of coercive subtyping, a theory of abbreviation for dependent type theories, is incorporated into the polymorphic type system in functional programming languages. The tra...
BIRTHDAY
2006
Springer
13 years 11 months ago
2006
Springer
Abstract. This paper gives a reduction-preserving translation from Coquand's dependent pattern matching [4] into a traditional type theory [11] with universes, inductive types...
FP
1991
13 years 11 months ago
1991
The notion of functionality is not cast in stone, but depends upon what we have as types in our language. With partial equivalence relations (pers) as types we show that the funct...
ELP
1991
13 years 11 months ago
1991
Operational semantics provide a simple, high-level and elegant means of specifying interpreters for programming languages. In natural semantics, a form of operational semantics, p...