PN Benton - International Workshop on Computer Science Logic, 1994 - Springer
Intuitionistic linear logic regains the expressive power of intuitionistic logic through the!('of course') modality. Benton, Bierman, Hyland and de Paiva have given a term assignment …
This book is a cross-linguistic investigation of resumptive pronouns and related phenomena. Pronominal resumption is the realization of the base of a syntactic dependency as a bound …
AM Pitts - Handbook of logic in computer science, 2001 - books.google.com
This chapter provides an introduction to the interaction between category theory and mathematical logic. Category theory describes properties of mathematical structures via their …
We present a new intuitionistic linear logic, Dual Intuitionistic Linear Logic, designed to reflect the motivation of exponentials as translations of intuitionistic types, and provide it with …
This is a monograph about logic. Specifically, it presents the mathe matical theory of the logic of bunched implications, BI: I consider Bl's proof theory, model theory and computation …
We present the linear type theory λΠ⊸ &⊤ as the formal basis for LLF, a conservative extension of the logical framework LF. LLF combines the expressive power of dependent …
Inductive datatypes provide mechanisms to define finite data such as finite lists and trees via constructors and allow programmers to analyze and manipulate finite data via pattern …
This dissertation presents a theory of resumption based on semantic composition. The theory achieves a unified explanation of resumptive pronouns and copy raising. The basis is …
This is the first book-length treatment of hybrid logic and its proof-theory. Hybrid logic is an extension of ordinary modal logic which allows explicit reference to individual points in a …