65 search results - page 6 / 13 » Definitions by Rewriting in the Calculus of Constructions |
ENTCS
2008
14 years 9 months ago
2008
Deep inference is a proof theoretical methodology that generalizes the traditional notion of inference in the sequent calculus: in contrast to the sequent calculus, the deductive ...
70
Voted
AOSD
2007
ACM
15 years 1 months ago
2007
ACM
Beginning with BETA, a range of programming language mechanisms such as virtual classes (class-valued attributes of objects) have been developed to allow inheritance in the presen...
ICSE
2008
IEEE-ACM
15 years 10 months ago
2008
IEEE-ACM
WS-BPEL applications are a kind of service-oriented application. They use XPath extensively to integrate loosely-coupled workflow steps. However, XPath may extract wrong data from...
156
click to vote
POPL
2004
ACM
15 years 10 months ago
2004
ACM
We present a notion of -long ? -normal term for the typed lambda calculus with sums and prove, using Grothendieck logical relations, that every term is equivalent to one in norm...
RTA
2005
Springer
15 years 3 months ago
2005
Springer
We present constructive arithmetic in Deduction modulo with rewrite rules only. In natural deduction and in sequent calculus, the cut elimination theorem and the analysis of the st...