65 citations · 211 across the 36 of their papers we have counts for
4 papers · 1 filter
Static Dependency Pair Method based on Strong Computability for Higher-Order Rewrite Systems
Keiichirou Kusakari, Yasuo Isogai, Masahiko Sakai +1
Higher-order rewrite systems (HRSs) and simply-typed term rewriting systems (STRSs) are computational models of functional programs. We recently proposed an extremely powerful meth…
Argument filterings and usable rules in higher-order rewrite systems
Sho Suzuki, Keiichirou Kusakari, Frédéric Blanqui
The static dependency pair method is a method for proving the termination of higher-order rewrite systems a la Nipkow. It combines the dependency pair method introduced for first-o…
On the confluence of lambda-calculus with conditional rewriting
Frédéric Blanqui, Claude Kirchner, Colin Riba
The confluence of untyped λ-calculus with unconditional rewriting is now well un- derstood. In this paper, we investigate the confluence of λ-calculus with conditional rewriting an…
Designing a CPU model: from a pseudo-formal document to fast code
Frédéric Blanqui, Claude Helmstetter, Vania Joloboff +2
For validating low level embedded software, engineers use simulators that take the real binary as input. Like the real hardware, these full-system simulators are organized as a set…