Sciweavers

136 search results - page 1 / 28
» A Logical Framework with Explicit Conversions
Sort
View
ENTCS
2008
94views more  ENTCS 2008»
13 years 5 months ago
A Logical Framework with Explicit Conversions
The type theory P corresponds to the logical framework LF. In this paper we present H, a variant of P where convertibility is not implemented by means of the customary conversion ...
Herman Geuvers, Freek Wiedijk
BIRTHDAY
2004
Springer
13 years 11 months ago
Pure Type Systems in Rewriting Logic: Specifying Typed Higher-Order Languages in a First-Order Logical Framework
Abstract. The logical and operational aspects of rewriting logic as a logical framework are tested and illustrated in detail by representing pure type systems as object logics. Mor...
Mark-Oliver Stehr, José Meseguer
CSFW
2008
IEEE
14 years 3 days ago
An Authorization Logic With Explicit Time
We present an authorization logic that permits reasoning with explicit time. Following a proof-theoretic approach, we study the meta-theory of the logic, including cut elimination...
Henry DeYoung, Deepak Garg, Frank Pfenning
CORR
2010
Springer
194views Education» more  CORR 2010»
13 years 3 months ago
A Focused Sequent Calculus Framework for Proof Search in Pure Type Systems
Basic proof search tactics in logic and type theory can be seen as the root-rst applications of rules in an appropriate sequent calculus, preferably without the redundancies gener...
Stéphane Lengrand, Roy Dyckhoff, James McKi...
RTA
2009
Springer
14 years 5 days ago
An Explicit Framework for Interaction Nets
Abstract. Interaction nets are a graphical formalism inspired by Linear Logic proof-nets often used for studying higher order rewriting e.g. β-reduction. Traditional presentations...
Marc de Falco