4573 search results - page 485 / 915 » Automated Reasoning |
148
click to vote
LICS
2008
IEEE
16 years 16 days ago
2008
IEEE
Using appropriate notation systems for proofs, cutreduction can often be rendered feasible on these notations. Explicit bounds can be given. Developing a suitable notation system ...
141
click to vote
LICS
2008
IEEE
16 years 16 days ago
2008
IEEE
— This paper presents a decidable characterization of tree languages that can be defined by a boolean combination of Σ1 formulas. This is a tree extension of the Simon theorem,...
153
click to vote
LICS
2008
IEEE
16 years 16 days ago
2008
IEEE
We show that reachability and termination for lossy channel systems is exactly at level Fωω in the Fast-Growing Hierarchy of recursive functions, the first level that dominates...
149
click to vote
TPHOL
2008
IEEE
16 years 16 days ago
2008
IEEE
We present a novel compiled approach to Normalization by Evaluation (NBE) for ML-like languages. It supports efficient normalization of open λ-terms w.r.t. β-reduction and rewrit...
177
click to vote
TPHOL
2008
IEEE
16 years 16 days ago
2008
IEEE
The HOL4 proof assistant supports specification and proof in classical higher order logic. It is the latest in a long line of similar systems. In this short overview, we give an o...