Proceedings of the 11th EACSL Annual Conference / 16th International Workshop on Computer Science Logic
BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
EDIT!
CC-BY
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter

Julian C. Bradfield
Proceedings of the 11th EACSL Annual Conference / 16th International Workshop on Computer Science Logic
CSL, 2002.

TEST
DBLP
Scholar
Full names Links ISxN
@proceedings{CSL-2002,
	address       = "Edinburgh, Scotland, United Kingdom",
	editor        = "Julian C. Bradfield",
	isbn          = "3-540-44240-5",
	publisher     = "{Springer International Publishing}",
	series        = "{Lecture Notes in Computer Science}",
	title         = "{Proceedings of the 11th EACSL Annual Conference / 16th International Workshop on Computer Science Logic}",
	volume        = 2471,
	year          = 2002,
}

Contents (40 items)

CSL-2002-HayashiA
Limit-Computable Mathematics and Its Applications (SH, YA), p. 1.
CSL-2002-Neven #automaton #logic #xml
Automata, Logic, and XML (FN), pp. 2–26.
CSL-2002-Niwinski #calculus #game studies #μ-calculus
μ-Calculus via Games (DN), pp. 27–43.
CSL-2002-Kanovich
Bijections between Partitions by Two-Directional Rewriting Techniques (MIK), pp. 44–58.
CSL-2002-AehligJ #normalisation #on the
On Continuous Normalization (KA, FJ), pp. 59–73.
CSL-2002-ChernovSSV #logic
Variants of Realizability for Propositional Formulas and the Logic of the Weak Law of Excluded Middle (AVC, DPS, EZS, NKV), pp. 74–88.
CSL-2002-BridgesIS #revisited
Compactness and Continuity, Constructively Revisited (DSB, HI, PS), pp. 89–102.
CSL-2002-Nipkow #bound #hoare #logic #nondeterminism #recursion
Hoare Logics for Recursive Procedures and Unbounded Nondeterminism (TN), pp. 103–119.
CSL-2002-Chen #fixpoint #parallel
A Fixpoint Theory for Non-monotonic Parallelism (YC), pp. 120–134.
CSL-2002-EsikL #algebra #normalisation
Greibach Normal Form in Algebraically Complete Semirings (, HL), pp. 135–150.
CSL-2002-MairsonR #semantics
Proofnets and Context Semantics for the Additives (HGM, XR), pp. 151–166.
CSL-2002-HodasLPSP #logic programming #proving #resource management
A Tag-Frame System of Resource Management for Proof Search in Linear-Logic Programming (JSH, PL, JP, LS, EP), pp. 167–182.
CSL-2002-GalmicheMP
Resource Tableaux (DG, DM, DJP), pp. 183–199.
CSL-2002-Cenciarelli
Configuration Theories (PC), pp. 200–215.
CSL-2002-MoshierJ #logic #semantics
A Logic for Probabilities in Semantics (MAM, AJ), pp. 216–231.
CSL-2002-Levy #call-by #semantics
Possible World Semantics for General Storage in Call-By-Value (PBL), pp. 232–246.
CSL-2002-McCusker #relational
A Fully Abstract Relational Model of Syntactic Control of Interference (GM), pp. 247–261.
CSL-2002-MarcinkowskiT #bound #complexity #game studies #ltl
Optimal Complexity Bounds for Positive LTL Games (JM, TT), pp. 262–275.
CSL-2002-KuceraS #logic #ltl
The Stuttering Principle Revisited: On the Expressiveness of Nested X and U Operators in the Logic LTL (AK, JS), pp. 276–291.
CSL-2002-JurdzinskiKH #probability
Trading Probability for Fairness (MJ, OK, TAH), pp. 292–305.
CSL-2002-BeauquierRS #decidability #logic #model checking #probability
A Logic of Probability with Decidable Model-Checking (DB, AMR, AS), pp. 306–321.
CSL-2002-CachatDT #automaton #game studies
Solving Pushdown Games with a Σ₃ Winning Condition (TC, JD, WT), pp. 322–336.
CSL-2002-Kreutzer #fixpoint #infinity #logic
Partial Fixed-Point Logic on Infinite Structures (SK), pp. 337–351.
CSL-2002-BerwangerGL #calculus #on the #μ-calculus
On the Variable Hierarchy of the Modal μ-Calculus (DB, EG, GL), pp. 352–366.
CSL-2002-Leivant #complexity
Implicit Computational Complexity for Higher Type Functionals (DL), pp. 367–381.
CSL-2002-BaazM #on the
On Generalizations of Semi-terms of Particularly Simple Form (MB, GM), pp. 382–396.
CSL-2002-BarbanchonG #linear #problem
Local Problems, Planar Local Problems and Linear Time (RB, EG), pp. 397–411.
CSL-2002-BohlerHRV #constraints #equivalence #morphism
Equivalence and Isomorphism for Boolean Constraint Satisfaction (EB, EH, SR, HV), pp. 412–426.
CSL-2002-Faggian #design
Travelling on Designs (CF), pp. 427–441.
CSL-2002-FaggianH #design
Designs, Disputes and Strategies (CF, MH), pp. 442–457.
CSL-2002-Hasegawa #linear #logic
Classical Linear Logic of Implications (MH), pp. 458–472.
CSL-2002-Goubault-Larrecq #constraints #higher-order #set
Higher-Order Positive Set Constraints (JGL), pp. 473–489.
CSL-2002-Ogata #continuation #proving
A Proof Theoretical Account of Continuation Passing Style (IO), pp. 490–505.
CSL-2002-Kakutani #call-by #recursion
Duality between Call-by-Name Recursion and Call-by-Value Iteration (YK), pp. 506–521.
CSL-2002-Schmidt-SchaussS #bound #decidability #higher-order #unification
Decidability of Bounded Higher-Order Unification (MSS, KUS), pp. 522–536.
CSL-2002-GeuversJ #interactive #logic #proving
Open Proofs and Open Terms: A Basis for Interactive Logic (HG, GIJ), pp. 537–552.
CSL-2002-Goubault-LarrecqLN #logic #monad
Logical Relations for Monadic Types (JGL, SL, DN), pp. 553–568.
CSL-2002-AtseriasB #on the #proving
On the Automatizability of Resolution and Related Propositional Proof Systems (AA, MLB), pp. 569–583.
CSL-2002-Nivelle #normalisation #proving
Extraction of Proofs from the Clausal Normal Form Transformation (HdN), pp. 584–598.
CSL-2002-Beckmann #proving #strict
Resolution Refutations and Propositional Proofs with Height-Restrictions (AB), pp. 599–612.

Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev.
Hosted as a part of SLEBOK on GitHub.