Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
First Order Linear Logic Symmetric Monoidal Closed
 

Summary: First Order Linear Logic
in
Symmetric Monoidal Closed
Categories
Simon John Ambler
Doctor of Philosophy
University of Edinburgh
1991

1
Abstract
There has recently been considerable interest in the development of `logical
frameworks' which can represent many of the logics arising in computer science in
a uniform way. Within the Edinburgh LF project, this concept is split into two
components; the rst being a general proof theoretic encoding of logics, and the
second a uniform treatment of their model theory. This thesis forms a case study
for the work on model theory.
The models of many rst and higher order logics can be represented as bred
or indexed categories with certain extra structure, and this has been suggested as
a general paradigm. The aim of the thesis is to test the strength and exibility of

  

Source: Ambler, Simon - Department of Computer Science, University of Leicester

 

Collections: Computer Technologies and Information Sciences