Sciweavers

3670 search results - page 36 / 734
» Linear Recursive Functions
Sort
View
ICDT
1995
ACM
96views Database» more  ICDT 1995»
14 years 1 months ago
On Two Forms of Structural Recursion
We investigate and compare two forms of recursion on sets for querying nested collections. The rst one is called sri and it corresponds to sequential processing of data. The second...
Dan Suciu, Limsoon Wong
ITP
2010
172views Mathematics» more  ITP 2010»
14 years 1 months ago
Equations: A Dependent Pattern-Matching Compiler
Abstract. We present a compiler for definitions made by pattern matching on inductive families in the Coq system. It allows to write structured, recursive dependently-typed functi...
Matthieu Sozeau
AAECC
2007
Springer
148views Algorithms» more  AAECC 2007»
13 years 9 months ago
Enhancing dependency pair method using strong computability in simply-typed term rewriting
We enhance the dependency pair method in order to prove termination using recursive structure analysis in simply-typed term rewriting systems, which is one of the computational mod...
Keiichirou Kusakari, Masahiko Sakai
AUTOMATICA
2004
85views more  AUTOMATICA 2004»
13 years 9 months ago
Non-regular feedback linearization of nonlinear systems via a normal form algorithm
In this paper, the problem of non-regular static state feedback linearization of a ne nonlinear systems is considered. First of all, a new canonical form for non-regular feedback ...
Daizhan Cheng, Xiaoming Hu, Yuzhen Wang
FUIN
2007
138views more  FUIN 2007»
13 years 9 months ago
Parsing Expression Grammar as a Primitive Recursive-Descent Parser with Backtracking
Two recent developments in the field of formal languages are Parsing Expression Grammar (PEG) and packrat parsing. The PEG formalism is similar to BNF, but defines syntax in ter...
Roman R. Redziejowski