Sciweavers

1283 search results - page 164 / 257
» Science: the rules of the game
Sort
View
GI
2009
Springer
15 years 11 months ago
Taming Selective Strictness
Abstract: Free theorems establish interesting properties of parametrically polymorphic functions, solely from their types, and serve as a nice proof tool. For pure and lazy functio...
Daniel Seidel, Janis Voigtländer
TLCA
2001
Springer
15 years 10 months ago
Strong Normalisation for a Gentzen-like Cut-Elimination Procedure
In this paper we introduce a cut-elimination procedure for classical logic, which is both strongly normalising and consisting of local proof transformations. Traditional cut-elimin...
Christian Urban
TLCA
1999
Springer
15 years 10 months ago
Strong Normalisation of Cut-Elimination in Classical Logic
In this paper we present a strongly normalising cut-elimination procedure for classical logic. This procedure adapts Gentzen’s standard cut-reductions, but is less restrictive th...
Christian Urban, Gavin M. Bierman
RTA
2010
Springer
15 years 10 months ago
A Proof Calculus Which Reduces Syntactic Bureaucracy
In usual proof systems, like the sequent calculus, only a very limited way of combining proofs is available through the tree structure. We present in this paper a logicindependent ...
Alessio Guglielmi, Tom Gundersen, Michel Parigot
ACSC
2004
IEEE
15 years 10 months ago
Formalization of UML Statechart Models Using Concurrent Regular Expressions
The Unified Modeling Language (UML) is widely used in the software development process for specification of system based on the object-oriented paradigm. Thought the current versi...
S. Jansamak, A. Surarerks