Sciweavers

119 search results - page 11 / 24
» Alpha-Structural Recursion and Induction
Sort
View
SCP
2011
255views Communications» more  SCP 2011»
13 years 5 months ago
Map fusion for nested datatypes in intensional type theory
A definitional extension LNGMIt of the Calculus of Inductive Constructions (CIC), that underlies the proof assistant Coq, is presented that allows also to program with nested dat...
Ralph Matthes
BIRTHDAY
2006
Springer
14 years 2 months ago
Eliminating Dependent Pattern Matching
Abstract. This paper gives a reduction-preserving translation from Coquand's dependent pattern matching [4] into a traditional type theory [11] with universes, inductive types...
Healfdene Goguen, Conor McBride, James McKinna
JLP
2007
114views more  JLP 2007»
13 years 10 months ago
Deaccumulation techniques for improving provability
Several induction theorem provers were developed to verify functional programs mechanically. Unfortunately, automatic verification often fails for functions with accumulating arg...
Jürgen Giesl, Armin Kühnemann, Janis Voi...
RAS
2008
112views more  RAS 2008»
13 years 10 months ago
Learning and generalising semantic knowledge from object scenes
The robot described in this paper learns words that relate to objects and their attributes and also learns concepts, which may be recursive, that involve relationships between sev...
Claire D'Este, Claude Sammut
TACAS
2010
Springer
225views Algorithms» more  TACAS 2010»
14 years 5 months ago
Automated Termination Analysis for Programs with Second-Order Recursion
Many algorithms on data structures such as terms (finitely branching trees) are naturally implemented by second-order recursion: A first-order procedure f passes itself as an arg...
Markus Aderhold