5 search results - page 1 / 1 » Fibrational Induction Rules for Initial Algebras |
CSL
2010
Springer
13 years 12 months ago
2010
Springer
This paper provides an induction rule that can be used to prove properties of data structures whose types are inductive, i.e., are carriers of initial algebras of functors. Our res...
CALCO
2011
Springer
12 years 10 months ago
2011
Springer
This paper extends the fibrational approach to induction and coinduction pioneered by Hermida and Jacobs, and developed by the current authors, in two key directions. First, we pr...
TLCA
2007
Springer
14 years 5 months ago
2007
Springer
Initial algebra semantics is a cornerstone of the theory of modern functional programming languages. For each inductive data type, it provides a fold combinator encapsulating struc...
SAS
1993
Springer
14 years 2 months ago
1993
Springer
A new construction of a finite set of strictness properties for any lazy algebraic datatype is presented. The construction is based on the categorical view of the solutions to the...
MCMASTER
1993
14 years 2 months ago
1993
Abstract. This survey of the theory and applications of rewriting with equations discusses the existence and uniqueness of normal forms, the Knuth-Bendix completion procedure and i...