A Multiple-Conclusion Meta-Logic

A Multiple-Conclusion Meta-Logic (1994)

by Dale Miller

Venue:	In Proceedings of 9th Annual IEEE Symposium On Logic In Computer Science
Citations:	84 - 7 self

Datum	Value	Source
TITLE	A Multiple-Conclusion Meta-Logic	SVM HeaderParse 0.2
AUTHOR NAME	Dale Miller	SVM HeaderParse 0.2
AUTHOR AFFIL	Computer Science Department, University of Pennsylvania	SVM HeaderParse 0.2
AUTHOR ADDR	Philadelphia, PA 19104-6389 USA	SVM HeaderParse 0.2
ABSTRACT	The theory of cut-free sequent proofs has been used to motivate and justify the design of a number of logic programming languages. Two such languages, λProlog and its linear logic refinement, Lolli [12], provide data types, higher-order programming) but lack primitives for concurrency. The logic programming language, LO (Linear Objects) [2] provides for concurrency but lacks abstraction mechanisms. In this paper we present Forum, a logic programming presentation of all of linear logic that modularly extends the languages λProlog, Lolli, and LO. Forum, therefore, allows specifications to incorporate both abstractions and concurrency. As a meta-language, Forum greatly extends the expressiveness of these other logic programming languages. To illustrate its expressive strength, we specify in Forum a sequent calculus proof system and the operational semantics of a functional programming language that incorporates such nonfunctional features as counters and references. 1	SVM HeaderParse 0.2
YEAR	1994	INFERENCE
VENUE	In Proceedings of 9th Annual IEEE Symposium On Logic In Computer Science	INFERENCE
VENUE TYPE	CONFERENCE	INFERENCE
PAGES	272--281	INFERENCE
CITATIONS	21 found	ParsCit 1.0