10 search results - page 2 / 2 » Inductive Type Schemas as Functors |
CALCO
2011
Springer
12 years 7 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...
ENTCS
2006
13 years 7 months ago
2006
It can be traced back to Brouwer that continuous functions of type StrA B, where StrA is the type of infinite streams over elements of A, can be represented by well founded, Abra...
CSL
2010
Springer
13 years 8 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...
WWW
2008
ACM
14 years 8 months ago
2008
ACM
We propose a method of classifying XML documents and extracting XML schema from XML by inductive inference based on constraint logic programming. The goal of this work is to type ...
CEFP
2009
Springer
13 years 5 months ago
2009
Springer
Programmers happily use induction to prove properties of recursive programs. To show properties of corecursive programs they employ coinduction, but perhaps less enthusiastically. ...