Egon Börger, Yuri Gurevich, Karl Meinke
Selected Papers of the Seventh Workshop on Computer Science Logic
CSL, 1993.
@proceedings{CSL-1993, address = "Swansea, United Kingdom", editor = "Egon Börger and Yuri Gurevich and Karl Meinke", isbn = "3-540-58277-0", publisher = "{Springer-Verlag}", series = "{Lecture Notes in Computer Science}", title = "{Selected Papers of the Seventh Workshop on Computer Science Logic}", volume = 832, year = 1993, }
Contents (22 items)
- CSL-1993-AikenKVW #complexity #constraints #set
- The Complexity of Set Constraints (AA, DK, MYV, ELW), pp. 1–17.
- CSL-1993-AmblerKM #calculus #on the #μ-calculus
- On Duality for the Modal μ-Calculus (SA, MZK, NM), pp. 18–32.
- CSL-1993-BaazZ #equivalence #proving #using
- Short Proofs of Tautologies Using the Schema of Equivalence (MB, RZ), pp. 33–35.
- CSL-1993-BergstraBP #algebra #combinator #process
- Process Algebra with Combinators (JAB, IB, AP), pp. 36–65.
- CSL-1993-Blass #game studies #question #semantics
- Is Game Semantics Necessary? (AB), pp. 66–77.
- CSL-1993-ComptonU #concurrent
- The Model Theory of Concurrency (KJC, RUS), pp. 78–90.
- CSL-1993-Coquand #analysis #semantics
- From Semantics to Rules: A Machine Assisted Analysis (CC), pp. 91–105.
- CSL-1993-GoerdtK #backtracking #on the #parallel
- On the Reasons for Average Superlinear Speedup in Parallel Backtrack Search (AG, UK), pp. 106–127.
- CSL-1993-Gomolko #consistency #logic #nondeterminism #prolog
- Negation as Inconsistency in PROLOG via Intuitionistic Logic (AG), pp. 128–138.
- CSL-1993-GradelM #problem #random
- Approximable Minimization Problems and Optimal Solutions on Random Inputs (EG, AM), pp. 139–149.
- CSL-1993-Grohe #bound #fixpoint #logic
- Bounded-Arity Hierarchies in Fixed-Point Logics (MG), pp. 150–164.
- CSL-1993-Hishfeld #equivalence #petri net #problem
- Petri Nets and the Equivalence Problem (YH), pp. 165–174.
- CSL-1993-Kozen #aspect-oriented #constraints #logic #set
- Logical Aspects of Set Constraints (DK), pp. 175–188.
- CSL-1993-MakowskyP #quantifier
- Oracles and Quantifiers (JAM, YBP), pp. 189–222.
- CSL-1993-Marcinkowski #decidability #horn clause #set
- A Horn Clause that Implies and Undecidable Set of Horn Clauses (JM), pp. 223–237.
- CSL-1993-Milner #calculus #higher-order
- Higher-Order Action Calculi (RM), pp. 238–260.
- CSL-1993-OngR #calculus #normalisation
- A Generic Strong Normalization Argument: Application to the Calculus of Constructions (CHLO, ER), pp. 261–279.
- CSL-1993-Raffalli #data type #infinity #similarity
- Data Types, Infinity and Equality in System AF2 (CR), pp. 280–294.
- CSL-1993-Ritter #normalisation #λ-calculus
- Normalization for Typed λ Calculi with Explicit Substitution (ER), pp. 295–304.
- CSL-1993-SiegW #program transformation #proving
- Program Transformation and Proof Transformation (WS, SSW), pp. 305–317.
- CSL-1993-Stewart #fixpoint #quantifier
- Incorporating Generalized Quantifiers and the Least Fixed Point Operator (IAS), pp. 318–333.
- CSL-1993-GurevichH #c #programming language #semantics
- ERRATA to “The Semantics of the C Programming Language” (YG, JKH), pp. 334–336.
3 ×#calculus
3 ×#logic
3 ×#semantics
3 ×#set
2 ×#constraints
2 ×#equivalence
2 ×#fixpoint
2 ×#normalisation
2 ×#on the
2 ×#problem
3 ×#logic
3 ×#semantics
3 ×#set
2 ×#constraints
2 ×#equivalence
2 ×#fixpoint
2 ×#normalisation
2 ×#on the
2 ×#problem