Sciweavers

7943 search results - page 75 / 1589
» A calculus for costed computations
Sort
View
FCT
2007
Springer
15 years 4 months ago
FJMIP: A Calculus for a Modular Object Initialization
In most mainstream object-oriented languages, the object initialization protocol is based on constructors, where different constructors of the same class are, in fact, overloaded ...
Viviana Bono, Jaroslaw D. M. Kusmierek
CORR
2008
Springer
179views Education» more  CORR 2008»
14 years 10 months ago
Induction and Co-induction in Sequent Calculus
Abstract. Proof search has been used to specify a wide range of computation systems. In order to build a framework for reasoning about such specifications, we make use of a sequent...
Alwen Tiu, Alberto Momigliano
WOLLIC
2009
Springer
15 years 4 months ago
Deep Inference in Bi-intuitionistic Logic
Bi-intuitionistic logic is the extension of intuitionistic logic with exclusion, a connective dual to implication. Cut-elimination in biintuitionistic logic is complicated due to t...
Linda Postniece
TGC
2005
Springer
15 years 3 months ago
A General Name Binding Mechanism
We study fusion and binding mechanisms in name passing process calculi. To this purpose, we introduce the U-Calculus, a process calculus with no I/O polarities and a unique form of...
Michele Boreale, Maria Grazia Buscemi, Ugo Montana...
ENTCS
2008
96views more  ENTCS 2008»
14 years 10 months ago
Maude as a Platform for Designing and Implementing Deep Inference Systems
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 ...
Ozan Kahramanogullari