<--- Back to Details
First PageDocument Content
Computability theory / Theoretical computer science / Recursion / Process calculi / -calculus / Type / Linear logic / Linearity / Primitive recursive function / operator
Date: 2014-01-09 09:03:28
Computability theory
Theoretical computer science
Recursion
Process calculi
-calculus
Type
Linear logic
Linearity
Primitive recursive function
operator

Replication, Recursion and Concurrency J. Garrett Morris University of Edinburgh Sessions and linearity

Add to Reading List

Source URL: groups.inf.ed.ac.uk

Download Document from Source Website

File Size: 138,38 KB

Share Document on Facebook

Similar Documents

Optimal Multi-Valued LTL Planning for Systems with Access Right Levels Mohammad Hekmatnejad, and Georgios Fainekos Abstract— We propose a method for optimal Linear Temporal Logic (LTL) planning under incomplete or unce

Optimal Multi-Valued LTL Planning for Systems with Access Right Levels Mohammad Hekmatnejad, and Georgios Fainekos Abstract— We propose a method for optimal Linear Temporal Logic (LTL) planning under incomplete or unce

DocID: 1xUJO - View Document

Senior Thesis in Mathematics  Infiniteness and Linear Temporal Logic: Soundness, Completeness, & Decidability

Senior Thesis in Mathematics Infiniteness and Linear Temporal Logic: Soundness, Completeness, & Decidability

DocID: 1v3pn - View Document

The Geometry of Interaction as a Module System Ulrich Schöpp June 17, 2018 Abstract The Geometry of Interaction (goi) was originally introduced by Girard in the context of Linear Logic. Many of its recent applications c

The Geometry of Interaction as a Module System Ulrich Schöpp June 17, 2018 Abstract The Geometry of Interaction (goi) was originally introduced by Girard in the context of Linear Logic. Many of its recent applications c

DocID: 1uLd9 - View Document

Fast Reflexive Arithmetic Tactics the linear case and beyond Fr´ed´eric Besson? Irisa/Inria, Campus de Beaulieu, 35042 Rennes Cedex, France  Abstract. When goals fall in decidable logic fragments, users of proofassista

Fast Reflexive Arithmetic Tactics the linear case and beyond Fr´ed´eric Besson? Irisa/Inria, Campus de Beaulieu, 35042 Rennes Cedex, France Abstract. When goals fall in decidable logic fragments, users of proofassista

DocID: 1uBGC - View Document

On Structuring Proof Search for First Order Linear Logic

On Structuring Proof Search for First Order Linear Logic

DocID: 1uz8P - View Document