Abstract is missing.
- From logic to stochastic processes (abstract only)Prakash Panangaden. 1-2 [doi]
- A parallel implementation for optimal lambda-calculus reductionMarco Pedicini, Francesco Quaglia. 3-14 [doi]
- Logical relations, data abstraction, and structured fibrationsJohn Power, Edmund Robinson. 15-23 [doi]
- Operational semantics and extensionalitySimona Ronchi Della Rocca. 24-31 [doi]
- A high performance Erlang systemErik Johansson, Mikael Pettersson, Konstantinos F. Sagonas. 32-43 [doi]
- Concurrent constraint programming and linear logic (abstract)François Fages. 44 [doi]
- A framework for the recursive definition of data structuresJean-Louis Giavitto. 45-55 [doi]
- Declarative event-oriented programmingConal Elliott. 56-67 [doi]
- Linear logic programming with an ordered contextJeff Polakow. 68-79 [doi]
- Proof construction and non-commutativity: a cluster calculusClaudia Faggian. 80-91 [doi]
- A bottom-up semantics for linear logic programsMarco Bozzano, Giorgio Delzanno, Maurizio Martelli. 92-102 [doi]
- Enhanced sharing analysis techniques: a comprehensive evaluationRoberto Bagnara, Enea Zaffanella, Patricia M. Hill. 103-114 [doi]
- A characterization of symmetric semantics by domain complementationRoberto Giacobazzi, Isabella Mastroeni. 115-126 [doi]
- Concurrent constraint programming: towards probabilistic abstract interpretationAlessandra Di Pierro, Herbert Wiklicky. 127-138 [doi]
- Simplifying termination proofs for rewrite systems by preprocessingBernhard Gramlich. 139-150 [doi]
- A model for comparing the space usage of lazy evaluatorsAdam Bakewell, Colin Runciman. 151-162 [doi]
- Unification via ::::s::e::::::-style of explicit substitutionMauricio Ayala-Rincón, Fairouz Kamareddine. 163-174 [doi]
- Proof-carrying code: design, implementation and applications (abstract)George C. Necula. 175-177 [doi]
- Justifying proofs using memo tablesAbhik Roychoudhury, C. R. Ramakrishnan, I. V. Ramakrishnan. 178-189 [doi]
- Semantic analysis of pointer aliasing, allocation and disposal in Hoare logic351292Cristiano Calcagno, Samin S. Ishtiaq, Peter W. O Hearn. 190-201 [doi]
- Type-based nondeterminism checking in functional logic programsMichael Hanus, Frank Steiner. 202-213 [doi]
- A precise type analysis of logic programsLunjin Lu. 214-225 [doi]
- Efficient abstract interpretation using component-wise homomorphismsJörg Köller, Markus Mohnen. 226-234 [doi]
- Extending constraint logic programming with open functionsNikolay Pelov, Maurice Bruynooghe. 235-244 [doi]
- Efficient memory management in a merged heap/stack prolog machineXining Li. 245-256 [doi]
- Continuations for parallel logic programmingEneia Todoran, Nikolaos Papaspyrou. 257-267 [doi]
- Solving coverability problems of petri nets by partial deductionMichael Leuschel, Helko Lehmann. 268-279 [doi]
- Symmetric monoidal sketchesMartin Hyland, John Power. 280-288 [doi]
- Modular resetting of synchronous data-flow programsGrégoire Hamon, Marc Pouzet. 289-300 [doi]