Antonio Bucciarelli  Home/Search
Context
Related
| dcs.qmul.ac.uk/~pm/P...tcshypergraph.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: dcs.qmul.ac.uk/~pm/papers (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: The aim of this work is to show how hypergraphs can be used as a sistematic tool in the classi cation of continous boolean functions according to their degree of parallelism. Intuitively f is \less parallel" than g if it can be de ned by a sequential program using g as its only free variable. It turns out that the poset induced by this preorder is (as for the degrees of recursion) a sup-semilattice. Although hypergraphs had already been used in [6] as a tool for studying degrees of... (Update)
Active bibliography (related documents): More All
1.0: Degrees of Parallelism in the Continuous Type Hierarchy - BUCCIARELLI (1995) (Correct)
0.5: Degrees of Parallelism - Lichtenthäler (1996) (Correct)
0.5: Comparing Hierarchies of Types in Models of Linear Logic - Mellies (2003) (Correct)
Similar documents based on text: More All
0.1: Defining the Turing Jump - Shore, Slaman (1999) (Correct)
0.1: Full Abstraction for PCF (Extended Abstract) - Abramsky, Malacaria, Jagadeesan (Correct)
0.1: Non-Definability of the Class of Complete Bundled Trees - Zanardo, Barcellan, Reynolds (1999) (Correct)
BibTeX entry: (Update)
@article{ bucciarelli02relative,
author = "Antonio Bucciarelli and Pasquale Malacaria",
title = "Relative definability of boolean functions via hypergraphs",
journal = "Theoretical Computer Science",
volume = "278",
number = "1-2",
pages = "91-110",
year = "2002",
url = "citeseer.ist.psu.edu/500228.html" }
Citations (may not include all citations):306 LCF considered as a programming language (context) - Plotkin - 1977
68 On full abstraction for PCF (context) - Hyland, Ong - 1995
36 Stable models of typed lambda-calculi (context) - Berry
21 Reasoning about Sequential Functions via Logical Relations (context) - Sieber - 1992
15 Proof Techniques for Recursive Programs (context) - Vuillemin - 1973
9 Sequentiality in an extensional framework - Bucciarelli, Ehrhard - 1994
5 Rapport IRIA-LABORIA (context) - Kahn, Plotkin
3 On Representation of Sequential and Parallel Functions (context) - Trakhtenbrot - 1975
3 equats et stables des lambda-calculs types (context) - Berry, eles et al. - 1979
2 Degrees of Parallelism in Computations (context) - Sazonov - 1976
2 Lecture Notes in Computer Science (context) - Stoughton, Relations et al. - 1994
2 To appear in Information and Computation (context) - O'Hearn, Riecke et al.
2 Parallel and Serial Hypercoherences - Ehrhard - 1995
1 Lecure Notes in Computer Science (context) - Abramsky, Jagadeesan et al. - 1994
1 Computer Science Departement Memo (context) - Milner, LCF - 1973
1 Degrees of Parallelism in the Continous Type Hierarchy (context) - Bucciarelli
1 A type theoretic alternative to OWHY (context) - Scott
1 Selected Domains (context) - Amadio, Curien
Documents on the same site (http://www.dcs.qmul.ac.uk/~pm/papers.html): More
A New Approach to Control Flow Analysis - Malacaria, Hankin (1998) (Correct)
Studying Equivalences of Transition Systems with Algebraic Tools - Malacaria (1995) (Correct)
Non-deterministic Games and Program Analysis: An application.. - Malacaria, al. (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC