( en | de | ru )

 

Disambiguation of "Pratt, Vaughan R."

Author of the publication

copydeleteadd this publication to your clipboard
Two easy theories whose combination is hard

. Massachussets Institute of Technology, (September 1977)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

William Vaughan

Nadine Pratt

Karen Pratt

Larry Vaughan

Peter Vaughan Schmidt

 

Other publications of authors with the same name

Linear Process Algebra.. ICDCIT, volume 6536 of Lecture Notes in Computer Science, page 92-111. Springer, (2011)Shellsort and Sorting Networks. Outstanding Dissertations in the Computer Sciences Garland Publishing, New York, (1972)Standards and Performance Issues in the Workstation Market.. IEEE Computer Graphics and Applications, 4 (4): 71-76 (1984)Program Logic Without Binding is Decidable.. POPL, page 159-163. ACM Press, (1981)Nondeterminism in Logics of Programs., and . POPL, page 203-213. ACM Press, (1978)Every Prime has a Succinct Certificate.. SIAM J. Comput., 4 (3): 214-220 (1975)Broadening the denotational semantics of linear logic.. Linear Logic Tokyo Meeting, volume 3 of Electronic Notes in Theoretical Computer Science, page 155-166. Elsevier, (1996)Full Completeness of the Multiplicative Linear Logic of Chu Spaces., , , and . LICS, page 234-243. IEEE Computer Society, (1999)Semantical Considerations on Floyd-Hoare Logic. FOCS, page 109-121. IEEE Computer Society, (1976)A Decidable mu-Calculus: Preliminary Report. FOCS, page 421-427. IEEE Computer Society, (1981)