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, lambda Prolog and its linear logic refinement, Lolli, provide for various forms of abstraction (modules, abstract data types, and higher-order programming) but lack primitives for concurrency. The logic programming language LO (Linear Objects) provides some primitives for concurrency but lacks abstraction mechanisms. A logic programming presentation of all of higher-order linear logic, named Forum, modularly extends these other languages and also allows for abstractions and concurrency in specifications. To illustrate the expressive strengths of Forum, we specify in it a sequent calculus proof system and the operational semantics of a programming language that incorporates side-effects.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
