119 search results - page 21 / 24 » Alpha-Structural Recursion and Induction |
115
Voted
ICFP
2006
ACM
15 years 11 months ago
2006
ACM
This paper introduces a pattern for almost compositional functions over recursive data types, and over families of mutually recursive data types. Here "almost compositional&q...
COLT
2007
Springer
15 years 5 months ago
2007
Springer
For the natural notion of splitting classes into two disjoint subclasses via a recursive classifier working on texts, the question is addressed how these splittings can look in th...
ICFP
2005
ACM
15 years 11 months ago
2005
ACM
Monads are commonplace programming devices that are used to uniformly structure computations with effects such as state, exceptions, and I/O. This paper further develops the monad...
TPHOL
2009
IEEE
15 years 6 months ago
2009
IEEE
Abstract. FinFuns are total functions that are constant except for a finite set of points, i.e. a generalisation of finite maps. We formalise them in Isabelle/HOL and present how...
103
Voted
ICALP
2001
Springer
15 years 4 months ago
2001
Springer
We present a logical framework Υ for reasoning on a very general class of languages featuring binding operators, called nominal , presented in higher-order abstract syntax (HOAS)....