From light logics to type assignments: a case study

&
Logic Journal of the IGPL 17 (5):499-530 (2009)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.1093/jigpal/jzp019

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 93,642

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

From light logics to type assignments: a case study.Marco Gaboardi & Simona Della Rocca - 2009 - Logic Journal of the IGPL 17 (5):499-530.
Around splitting and reaping for partitions of ω.Hiroaki Minami - 2010 - Archive for Mathematical Logic 49 (4):501-518.
Review: D. C. Luckham, D. M. R. Park, M. S. Paterson, On Formalised Computer Programs. [REVIEW]D. C. Cooper - 1974 - Journal of Symbolic Logic 39 (2):347-347.
Weaker D-Complete Logics.Norman Megill & Martin Bunder - 1996 - Logic Journal of the IGPL 4 (2):215-225.
An Adaptive Logic Based on Jaśkowskiˈs Approach to Paraconsistency.Joke Meheus* - 2006 - Journal of Philosophical Logic 35 (6):539-567.
On intermediate predicate logics of some finite Kripke frames, I. levelwise uniform trees.Dmitrij Skvortsov - 2004 - Studia Logica 77 (3):295 - 323.
D. C. Luckham, D. M. R. Park, and M. S. Paterson. On formalised computer programs. Journal of computer and system sciences, vol. 4 , pp. 220–249. [REVIEW]D. C. Cooper - 1974 - Journal of Symbolic Logic 39 (2):347.
Three formats of prioritized adaptive logics: a comparative study.F. Van De Putte & C. Strasser - 2012 - Logic Journal of the IGPL 21 (2):127-159.
A Proof-theoretic Treatment Of Assignments.Wilfried Meyer-Viol - 1995 - Logic Journal of the IGPL 3 (2-3):223-242.
Predicate Logic (with Anaphora).I. I. I. Sem - unknown

Analytics

Added to PP
2016-06-30

Downloads
8 (#517,646)

6 months
4 (#1,635,958)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

Typability and type checking in System F are equivalent and undecidable.J. B. Wells - 1999 - Annals of Pure and Applied Logic 98 (1-3):111-156.

Add more references