2272 search results - page 195 / 455 » A Calculus for |
180
click to vote
TPHOL
2007
IEEE
16 years 26 days ago
2007
IEEE
We propose a method to extract purely functional contents from logical inductive types in the context of the Calculus of Inductive Constructions. This method is based on a mode con...
182
click to vote
BIRTHDAY
2007
Springer
16 years 24 days ago
2007
Springer
Superdeduction is a systematic way to extend a deduction system like the sequent calculus by new deduction rules computed from the user theory. We show how this could be done in a ...
252
click to vote
ILC
2007
Springer
16 years 23 days ago
2007
Springer
Two-way alternating automata were introduced by Vardi in order to study the satisfiability problem for the modal µ-calculus extended with backwards modalities. In this paper, we ...
158
click to vote
KSEM
2007
Springer
16 years 23 days ago
2007
Springer
Abstract. Description logics (DLs) are a well-known family of knowledge representation (KR) languages. The notation of DLs has the style of a variable-free first order predicate l...
170
click to vote
TLCA
2007
Springer
16 years 22 days ago
2007
Springer
Inspired by recent work on normalisation by evaluation for sums, we propose a normalising and confluent extensional rewriting theory for the simply-typed λ-calculus extended with...