Proceedings. Fourth Annual Symposium on Logic in Computer Science (Cat. No.89CH2753-2)

fYear

1989

fDate

5-8 June 1989

Abstract

The following topics are dealt with: domains and logics; computational lambda calculus and monads: stratified polymorphism; proof theory and semantics of logic programs; Parthenon, a parallel theorem prover; type inference for record concatenation and multiple inheritance; generalized unification problem; refinement in process algebras; game-theoretic modeling of concurrency; extending lambda calculus; the mathematics of nonmonotonic reasoning; substitutional recursion on non well-founded sets; unified algebras and institutions; Elf: a language for logic definition and verified metaprogramming; mu-definable sets of integers; compositional model checking; polynomially graded logic; and ECC, and extended calculus of constructions

Keywords

data structures; equivalence classes; formal languages; formal logic; ECC; Elf; Parthenon; compositional model checking; computational lambda calculus; concurrency; constructions; domains; extended calculus; game-theoretic modeling; generalized unification problem; institutions; integers; logic definition; logic programs; logics; mathematics; monads; mu-definable sets; multiple inheritance; non well-founded sets; nonmonotonic reasoning; parallel theorem prover; polynomially graded logic; process algebras; proof theory; record concatenation; refinement; semantics; stratified polymorphism; substitutional recursion; type inference; unified algebras; verified metaprogramming;

fLanguage

English

Publisher

ieee

Conference_Titel

Logic in Computer Science, 1989. LICS '89, Proceedings., Fourth Annual Symposium on

Conference_Location

Pacific Grove, CA, USA

Print_ISBN

0-8186-1954-6

Type

conf

DOI

10.1109/LICS.1989.39152

Filename

39152