Sciweavers

97 search results - page 4 / 20
» The Higher-Order Recursive Path Ordering
Sort
View
RTA
2004
Springer
14 years 1 months ago
A Type-Based Termination Criterion for Dependently-Typed Higher-Order Rewrite Systems
Several authors devised type-based termination criteria for ML-like languages allowing non-structural recursive calls. We extend these works to general rewriting and dependent type...
Frédéric Blanqui
ESOP
2008
Springer
13 years 10 months ago
Verification of Higher-Order Computation: A Game-Semantic Approach
Abstract. We survey recent developments in an approach to the verification of higher-order computation based on game semantics. Higherorder recursion schemes are in essence (progra...
C.-H. Luke Ong
ICDM
2006
IEEE
158views Data Mining» more  ICDM 2006»
14 years 2 months ago
Detection of Interdomain Routing Anomalies Based on Higher-Order Path Analysis
Internet routing dynamics have been extensively studied in the past few years. However, dynamics such as interdomain Border Gateway Protocol (BGP) behavior are still poorly unders...
Murat Can Ganiz, Sudhan Kanitkar, Mooi Choo Chuah,...
ENTCS
2006
176views more  ENTCS 2006»
13 years 8 months ago
Automatic Formal Synthesis of Hardware from Higher Order Logic
A compiler that automatically translates recursive function definitions in higher order logic to clocked synchronous hardware is described. Compilation is by mechanised proof in t...
Mike Gordon, Juliano Iyoda, Scott Owens, Konrad Sl...
ESOP
2007
Springer
14 years 2 months ago
Structure of a Proof-Producing Compiler for a Subset of Higher Order Logic
We give an overview of a proof-producing compiler which translates recursion equations, defined in higher order logic, to assembly language. The compiler is implemented and valida...
Guodong Li, Scott Owens, Konrad Slind