61 search results - page 8 / 13 » Towards Constructive Homological Algebra in Type Theory |
ICFP
2005
ACM
14 years 7 months ago
2005
ACM
High-level formalisms for reasoning about names and binding such uijn indices, various flavors of higher-order abstract syntax, ry of Contexts, and nominal abstract syntax address...
ICFP
2006
ACM
14 years 7 months ago
2006
ACM
Generic Haskell is a language extension of Haskell for polytypic programming. Constrained types are parametric algebraic types with at least one argument constrained by type-class...
TACS
1994
Springer
13 years 11 months ago
1994
Springer
In this paper we present a semantic theory for Concurrent ML. It consists of a new effect-based type system and a denotational model. The new type system is based on an extension o...
FOSSACS
2003
Springer
14 years 27 days ago
2003
Springer
We introduce the notion of containers as a mathematical formalisation of the idea that many important datatypes consist of templates where data is stored. We show that containers h...
PROCEDIA
2010
13 years 6 months ago
2010
When solving machine learning problems, there is currently little automated support for easily experimenting with alternative statistical models or solution strategies. This is be...