Hypergraphs and degrees of parallelism: A completeness result (2004)

Cached

Download Links

by Antonio Bucciarelli , Benjamin Leperchey
Venue:PROCEEDINGS OF THE 7TH INTERNATIONAL CONFERENCE OF FOUNDATIONS OF SOFTWARE SCIENCE AND COMPUTATION STRUCTURES – FOSSACS 2004
Citations:1 - 0 self

Active Bibliography

3 Relative Definability of Boolean Functions via Hypergraphs – Antonio Bucciarelli, Pasquale Malacaria
36 The sequentially realizable functionals – John Longley
INVESTIGATIONS ON RELATIVE DEFINABILITY IN PCF by – Riccardo R. Pucella - 2005
17 Definability and full abstraction – Pierre-Louis Curien
8 Degrees of Parallelism in the Continuous Type Hierarchy – Antonio Bucciarelli, Antonio Bucciarelli, Antonio Bucciarelli - 1995
Q Lecture Notes on Denotational Semantics – Part Ii, Computer Science Tripos, Dr Marcelo Fiore, C A. M. Pitts, G. Winskel, M. Fiore Contents
12 Notions of computability at higher types I – John Longley - 2005
A “Book ” proof that parallel convergence tester cannot implement parallel or – Prakash Panangaden - 2009
Contents – Peter Gammie - 2013
Equational Incompleteness and Incomparability Results for Lambda Calculus Functional Semantics – Olivier Bastonero
1 Functional Reachability – C. -h. L. Ong, N. Tzevelekos
4 A stable programming language – Luca Paolini
6 On the non-sequential nature of the interval-domain model of real-number computation – Martín Escardó, Martin Hofmann, Thomas Streicher
22 Projecting Sequential Algorithms on Strongly Stable Functions – Thomas Ehrhard - 1993
20 Strong Stability and the Incompleteness of Stable Models for λ-Calculus – Olivier Bastonero, Xavier Gouy - 1999
31 Games and full abstraction for nondeterministic languages – Russell S. Harmer - 1999
Realizability Models for Sequential Computation – John Longley - 1998
Natural non-dcpo Domains and f-Spaces Abstract – Vladimir Sazonov
Exploratory functions on nondeterministic strategies, up to lower bisimilarity – Paul Blain, Levy Kidane, Yemane Weldemariam