LICS A*

38 papers

YearTitle / Authors
1987A Framework for Defining Logics
Robert Harper, Furio Honsell, Gordon D. Plotkin
1987A Non-Type-Theoretic Definition of Martin-Löf's Types
Stuart Allen
1987A Semantical Approach to Nonmonotic Logics
Yoav Shoham
1987Complete Type Inference for Simple Objects
Mitchell Wand
1987Conjunctive Types and Algol-like Languages
John C. Reynolds
1987Decidability of the Confluence of Ground Term Rewriting Systems
Max Dauchet, Sophie Tison, Thierry Heuillard, Pierre Lescanne
1987Definability with Bounded Number of Bound Variables
Neil Immerman, Dexter Kozen
1987Domain Theory in Logical Form
Samson Abramsky
1987First-order Predicate Logic as a Common Basis for Relational and Functional Programming (Abstract).
Maarten H. van Emden
1987Full Abstraction and Expressive Completenes for FP
Joseph Y. Halpern, Edward L. Wimmers
1987Hereditary Harrop Formulas and Uniform Proof Systems
Dale Miller, Gopalan Nadathur, Andre Scedrov
1987Hoare Logic for Lambda-Terms as Basis of Hoare Logic for Imperative Languages
Andreas Goerdt
1987I'm OK if You're OK: On the Notion of Trusting Communication
Ronald Fagin, Joseph Y. Halpern
1987Inference Rules for Rewrite-Based First-Order Theorem Proving
Leo Bachmair, Nachum Dershowitz
1987Kripke-Style models for typed lambda calculus
John C. Mitchell, Eugenio Moggi
1987Minimalism subsumes Default Logic and Circumscription in Stratified Logic Programming
Nicole Bidoit, Christine Froidevaux
1987Modelling Computations: A 2-Categorical Framework
Robert A. G. Seely
1987On Chain Logic, Path Logic, and First-Order Logic over Infinite Trees
Wolfgang Thomas
1987On the Eventuality Operator in Temporal Logic
A. Prasad Sistla, Lenore D. Zuck
1987On the Formal Semantics of Statecharts (Extended Abstract)
David Harel, Amir Pnueli, Jeanette P. Schmidt, Rivi Sherman
1987Order-Sorted Algebra solves the Constructor-Selector, Multiple
Joseph A. Goguen, José Meseguer
1987Partial Objects In Constructive Type Theory
Robert L. Constable, Scott F. Smith
1987Partial Order Models of Concurrency and the Computation of Functions
Haim Gaifman, Vaughan R. Pratt
1987Polymorphism is conservative over simple types (Preliminary Report)
Val Tannen, Albert R. Meyer
1987Proceedings of the Symposium on Logic in Computer Science (LICS '87), Ithaca, New York, USA, June 22-25, 1987
1987Proving Boolean Combinations of Deterministic Properties
Bowen Alpern, Fred B. Schneider
1987Reasoning with Many Processes
A. Prasad Sistla, Steven M. German
1987Recursive Types and Type Constraints in Second-Order Lambda Calculus
Nax Paul Mendler
1987Solving Disequations
Claude Kirchner, Pierre Lescanne
1987Some Semantic Aspects of Polymorphic Lambda Calculus
Peter J. Freyd, Andre Scedrov
1987Some Uses of Maximal Fixed Points (Abstract of Invited Lecture)
Robin Milner
1987The Computational Behaviour of Girard's Paradox
Douglas J. Howe
1987The Hierarchy of Finitely Typed Functional Programs (Short Version)
A. J. Kfoury, Jerzy Tiuryn, Pawel Urzyczyn
1987The Power of Temporal Proofs
Martín Abadi
1987Theorem Proving Using Rigid E-Unification Equational Matings
Jean H. Gallier, Stan Raatz, Wayne Snyder
1987Undecidable Optimization Problems for Database Logic Programs
Haim Gaifman, Harry G. Mairson, Yehoshua Sagiv, Moshe Y. Vardi
1987Verification of Concurrent Programs: The Automata-Theoretic Framework
Moshe Y. Vardi
1987X-Separability and Left-Invertibility in lambda-calculus
Corrado Böhm, Enrico Tronci