212 search results - page 16 / 43 » Working with Mathematical Structures in Type Theory |
POPL
2010
ACM
14 years 5 months ago
2010
ACM
This paper introduces a new recursion principle for inductive data modulo -equivalence of bound names. It makes use of Oderskystyle local names when recursing over bound names. It...
OOPSLA
2005
Springer
14 years 2 months ago
2005
Springer
Generalized algebraic data types (GADTs) have received much attention recently in the functional programming community. They generalize the (type) parameterized algebraic datatype...
CALCO
2009
Springer
14 years 3 months ago
2009
Springer
Abstract. Coalgebra automata, introduced by the second author, generalize the well-known automata that operate on infinite words/streams, trees, graphs or transition systems. This...
IOR
2002
13 years 8 months ago
2002
Then these analytically motivated abstractions were gradually made more intricate as the body of mathematical techniques grew. The trend went from elementary analysis of complex, i...
SYNTHESE
2011
13 years 3 months ago
2011
: Both realists and instrumentalists have found it difficult to understand (much less accept) Carnap’s developed view on theoretical terms, which attempts to stake out a neutral ...