|
|
Conferences in DBLP
- Daniel Leivant
A Foundational Delineation of Computational Feasiblity [Citation Graph (0, 0)][DBLP]
LICS, 1991, pp:2-11 [Conf]
- Fabio Alessi, Franco Barbanera
Towards a Semantics for the QUEST Language [Citation Graph (0, 0)][DBLP]
LICS, 1991, pp:12-21 [Conf]
- Peter Aczel
Term Declaration Logic and Generalised Composita [Citation Graph (0, 0)][DBLP]
LICS, 1991, pp:22-30 [Conf]
- Joshua S. Hodas, Dale Miller
Logic Programming in a Fragment of Intuitionistic Linear Logic [Citation Graph (0, 0)][DBLP]
LICS, 1991, pp:32-42 [Conf]
- Yves Lafont, Thomas Streicher
Games Semantics for Linear Logic [Citation Graph (0, 0)][DBLP]
LICS, 1991, pp:43-50 [Conf]
- Patrick Lincoln, Andre Scedrov, Natarajan Shankar
Linearizing Intuitionistic Implication [Citation Graph (0, 0)][DBLP]
LICS, 1991, pp:51-62 [Conf]
- Pasquale Malacaria, Laurent Regnier
Some Results on the Interpretation of lambda-calculus in Operator Algebras [Citation Graph (0, 0)][DBLP]
LICS, 1991, pp:63-72 [Conf]
- Frank Pfenning
Unification and Anti-Unification in the Calculus of Constructions [Citation Graph (0, 0)][DBLP]
LICS, 1991, pp:74-85 [Conf]
- Philippe Audebaud
Partial Objects in the Calculus of Constructions [Citation Graph (0, 0)][DBLP]
LICS, 1991, pp:86-95 [Conf]
- Chetan R. Murthy
An Evaluation Semantics for Classical Proofs [Citation Graph (0, 0)][DBLP]
LICS, 1991, pp:96-107 [Conf]
- Rance Cleaveland, Amy E. Zwarico
A Theory of Testing for Real-Time [Citation Graph (0, 0)][DBLP]
LICS, 1991, pp:110-119 [Conf]
- Hardi Hungar
Complexity Bounds of Hoare-style Proof Systems [Citation Graph (0, 0)][DBLP]
LICS, 1991, pp:120-126 [Conf]
- Hing-Kai Hung, Jeffery I. Zucker
Semantics of Pointers, Referencing and Dereferencing with Intensional Logic [Citation Graph (0, 0)][DBLP]
LICS, 1991, pp:127-136 [Conf]
- Antonio Bucciarelli, Thomas Ehrhard
Sequentiality and Strong Stability [Citation Graph (0, 0)][DBLP]
LICS, 1991, pp:138-145 [Conf]
- Allen Stoughton
Parallel PCF Has a Unique Extensional Model [Citation Graph (0, 0)][DBLP]
LICS, 1991, pp:146-151 [Conf]
- Paul Taylor 0002
The Fixed Point Property in Synthetic Domain Theory [Citation Graph (0, 0)][DBLP]
LICS, 1991, pp:152-160 [Conf]
- Douglas J. Howe
On Computational Open-Endedness in Martin-Löf's Type Theory [Citation Graph (0, 0)][DBLP]
LICS, 1991, pp:162-172 [Conf]
- Nax Paul Mendler
Predicative Type Universes and Primitive Recursion [Citation Graph (0, 0)][DBLP]
LICS, 1991, pp:173-184 [Conf]
- Richard Statman
Freyd's Hierarchy of Combinator Monoids [Citation Graph (0, 0)][DBLP]
LICS, 1991, pp:186-190 [Conf]
- Enrico Tronci
Equational Prgoramming in lambda-calculus [Citation Graph (0, 0)][DBLP]
LICS, 1991, pp:191-202 [Conf]
- Ulrich Berger, Helmut Schwichtenberg
An Inverse of the Evaluation Functional for Typed lambda-calculus [Citation Graph (0, 0)][DBLP]
LICS, 1991, pp:203-211 [Conf]
- Dexter Kozen
A Completeness Theorem for Kleene Algebras and the Algebra of Regular Events [Citation Graph (0, 0)][DBLP]
LICS, 1991, pp:214-225 [Conf]
- Arnon Avron, Yoram Hirshfeld
On First Order Database Query Languages [Citation Graph (2, 0)][DBLP]
LICS, 1991, pp:226-231 [Conf]
- Doron Peled, Shmuel Katz, Amir Pnueli
Specifying and Proving Serializability in Temporal Logic [Citation Graph (0, 0)][DBLP]
LICS, 1991, pp:232-244 [Conf]
- Juanito Camilleri, Glynn Winskel
CCS with Priority Choice [Citation Graph (0, 0)][DBLP]
LICS, 1991, pp:246-255 [Conf]
- Nils Klarlund, Dexter Kozen
Rabin Measures and Their Applications to Fairness and Automata Theory [Citation Graph (0, 0)][DBLP]
LICS, 1991, pp:256-265 [Conf]
- Bengt Jonsson, Kim Guldstrand Larsen
Specification and Refinement of Probabilistic Processes [Citation Graph (0, 0)][DBLP]
LICS, 1991, pp:266-277 [Conf]
- Leszek Pacholski, Wieslaw Szwast
On the 0-1 Law for the class of Existential Second Order Minimal Gödel Sentences with Equality [Citation Graph (0, 0)][DBLP]
LICS, 1991, pp:280-285 [Conf]
- Maria Luisa Bonet, Samuel R. Buss
On the Deduction Rule and the Number of Proof Lines [Citation Graph (0, 0)][DBLP]
LICS, 1991, pp:286-297 [Conf]
- Thom W. Frühwirth, Ehud Y. Shapiro, Moshe Y. Vardi, Eyal Yardeni
Logic Programs as Types for Logic Programs [Citation Graph (1, 0)][DBLP]
LICS, 1991, pp:300-309 [Conf]
- Michael Kifer, James Wu
A First-Order Theory of Types and Polymorphism in Logic Programming [Citation Graph (2, 0)][DBLP]
LICS, 1991, pp:310-321 [Conf]
- Agostino Cortesi, Gilberto Filé, William H. Winsborough
Prop revisited: Propositional Formula as Abstract Domain for Groundness Analysis [Citation Graph (0, 0)][DBLP]
LICS, 1991, pp:322-327 [Conf]
- Peter J. Stuckey
Constructive Negation for Constraint Logic Programming [Citation Graph (0, 0)][DBLP]
LICS, 1991, pp:328-339 [Conf]
- Tobias Nipkow
Higher-Order Critical Pairs [Citation Graph (0, 0)][DBLP]
LICS, 1991, pp:342-349 [Conf]
- Jean-Pierre Jouannaud, Mitsuhiro Okada
A Computation Model for Executable Higher-Order Algebraic Specification Languages [Citation Graph (0, 0)][DBLP]
LICS, 1991, pp:350-361 [Conf]
- Mark Ryan
Defaults and Revision in Structured Theories [Citation Graph (1, 0)][DBLP]
LICS, 1991, pp:362-373 [Conf]
- Hans Hüttel, Colin Stirling
Actions Speak Louder than Words: Proving Bisimilarity for Context-Free Processes [Citation Graph (0, 0)][DBLP]
LICS, 1991, pp:376-386 [Conf]
- Frits W. Vaandrager
On the Relationship Between Process Algebra and Input/Output Automata [Citation Graph (0, 0)][DBLP]
LICS, 1991, pp:387-398 [Conf]
- Frank S. de Boer
A Compositional Proof System for Dynamic Process Creation [Citation Graph (0, 0)][DBLP]
LICS, 1991, pp:399-405 [Conf]
- Patrice Godefroid, Pierre Wolper
A Partial Approach to Model Checking [Citation Graph (0, 0)][DBLP]
LICS, 1991, pp:406-415 [Conf]
|
