Logic from Computer Science: Proceedings of a Workshop held November 13–17, 1989

Front Matter....Pages i-xi
The Imperative Future: Past Successes ⇒ Future Actions....Pages 1-16
A Logical Operational Semantics of Full Prolog: Part III. Built-In Predicates for Files, Terms, Arithmetic and Input-Output....Pages 17-50
Computability and Complexity of Higher Type Functions....Pages 51-72
Constructively Equivalent Propositions and Isomorphisms of Objects, or Terms as Natural Transformations....Pages 73-94
Logics for Termination and Correctness of Functional Programs....Pages 95-127
Transparent Grammars....Pages 129-151
Designing Unification Procedures Using Transformations: A Survey....Pages 153-215
Normal Forms and Cut-Free Proofs as Natural Transformations....Pages 217-241
Computer Implementation and Applications of Kleene’s S-M-N and Recursion Theorems....Pages 243-263
0–1 Laws for Fragments of Second-Order Logic: An Overview....Pages 265-286
No Counter-Example Interpretation and Interactive Computation....Pages 287-293
Semantic Characterizations of Number Theories....Pages 295-317
Constructive Kripke Semantics and Realizability....Pages 319-357
Splitting and Density for the Recursive Sets of a Fixed Time Complexity....Pages 359-372
Reals and Forcing with an Elementary Topos....Pages 373-385
Completeness Theorems for Logics of Feature Structures....Pages 387-403
Concurrent Programs as Strategies in Games....Pages 405-479
Finite and Infinite Dialogues....Pages 481-497
Some Relations Between Subsystems of Arithmetic and Complexity of Computations....Pages 499-519
Logics for Negation as Failure....Pages 521-583
Normal Varieties of Combinators....Pages 585-596
Complexity of Proofs in Classical Propositional Logic....Pages 597-608