Sciweavers

2272 search results - page 345 / 455
» A Calculus for
Sort
View
CORR
2008
Springer
121views Education» more  CORR 2008»
15 years 25 days ago
Graph Algorithms for Improving Type-Logical Proof Search
Proof nets are a graph theoretical representation of proofs in various fragments of type-logical grammar. In spite of this basis in graph theory, there has been relatively little ...
Richard Moot
ENTCS
2010
119views more  ENTCS 2010»
15 years 24 days ago
A Tableau Method for Checking Rule Admissibility in S4
Rules that are admissible can be used in any derivations in any axiomatic system of a logic. In this paper we introduce a method for checking the admissibility of rules in the mod...
Sergey Babenyshev, Vladimir V. Rybakov, Renate A. ...
81
Voted
ENTCS
2010
117views more  ENTCS 2010»
15 years 24 days ago
Categorifying Computations into Components via Arrows as Profunctors
The notion of arrow by Hughes is an axiomatization of the algebraic structure possessed by structured computations in general. We claim that an arrow also serves as a basic compon...
Kazuyuki Asada, Ichiro Hasuo
ENTCS
2008
101views more  ENTCS 2008»
15 years 24 days ago
Imperative LF Meta-Programming
Logical frameworks have enjoyed wide adoption as meta-languages for describing deductive systems. While the techniques for representing object languages in logical frameworks are ...
Aaron Stump
ENTCS
2008
97views more  ENTCS 2008»
15 years 24 days ago
Meta-programming With Built-in Type Equality
We report our experience with exploring a new point in the design space for formal reasoning systems: the development of the programming language mega. mega is intended as both a ...
Tim Sheard, Emir Pasalic