Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

6

CORR
2007
Springer

favoriteEmaildiscussreport

103views Education» more CORR 2007»

HORPO with Computability Closure : A Reconstruction

13 years 4 months ago

HORPO with Computability Closure : A Reconstruction

Download www.lsi.upc.edu

This paper provides a new, decidable deﬁnition of the higher-order recursive path ordering in which type comparisons are made only when needed, therefore eliminating the need for the computability closure, and bound variables are handled explicitly, making it possible to handle recursors for arbitrary strictly positive inductive types.

Frédéric Blanqui, Jean-Pierre Jouann

Real-time Traffic

Computability Closure | CORR 2007 | Decidable Deﬁnition | Education | Type Comparisons |

claim paper

Related Content

» HORPO with Computability Closure A Reconstruction

» TransitiveClosure Spanners A Survey

» Lower Bounds for Local Monotonicity Reconstruction from TransitiveClosure Spanners

» Linear Projective Reconstruction from Matching Tensors

» Double Window Optimisation for Constant Time Visual SLAM

» PlaneParallax Tensors and Factorization

» Discovering and exploiting 3D symmetries in structure from motion

» A Rational Deconstruction of Landins SECD Machine

» A Batch Algorithm for Implicit Nonrigid Shape and Motion Recovery

Post Info
More Details (n/a)

Added	13 Dec 2010
Updated	13 Dec 2010
Type	Journal
Year	2007
Where	CORR
Authors	Frédéric Blanqui, Jean-Pierre Jouannaud, Albert Rubio

Comments (0)