Logical specifications as productions for transformation of program graphs

Bulletin of Symbolic Logic 6 (1):133-134 (2000)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,672

External links

  • This entry has no external links. Add one.
Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

.Jay Zeman - unknown
“Setting” n-Opposition.Régis Pellissier - 2008 - Logica Universalis 2 (2):235-263.
Program verification: the very idea.James H. Fetzer - 1988 - Communications of the Acm 31 (9):1048--1063.
Expansions of Ultrahomogeneous Graphs.J. E. Helmreich - 1995 - Notre Dame Journal of Formal Logic 36 (3):414-424.
Small universal families for graphs omitting cliques without GCH.Katherine Thompson - 2010 - Archive for Mathematical Logic 49 (7-8):799-811.
Types as graphs: Continuations in type logical grammar. [REVIEW]Chris Barker & Chung-Chieh Shan - 2006 - Journal of Logic, Language and Information 15 (4):331-370.

Analytics

Added to PP
2014-01-19

Downloads
0

6 months
0

Historical graph of downloads

Sorry, there are not enough data points to plot this chart.
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references