Category Theory and Computer Science - Lecture Notes in Computer Science
Latest Publications

TOTAL DOCUMENTS

(FIVE YEARS 0)

H-INDEX

(FIVE YEARS 0)

Published By Springer-Verlag

354054495x

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Proof nets and coherence theorems

Category Theory and Computer Science - Lecture Notes in Computer Science ◽

10.1007/bfb0013461 ◽

2005 ◽

pp. 121-137 ◽

Cited By ~ 1

Author(s):

Richard Blute

Keyword(s):

Proof Nets

Download Full-text

Stone duality for stable functions

Category Theory and Computer Science - Lecture Notes in Computer Science ◽

10.1007/bfb0013453 ◽

2005 ◽

pp. 1-15 ◽

Cited By ~ 3

Author(s):

Thomas Ehrhard ◽

Pasquale Malacaria

Keyword(s):

Stone Duality

Download Full-text

Dataflow networks are fibrations

Category Theory and Computer Science - Lecture Notes in Computer Science ◽

10.1007/bfb0013470 ◽

2005 ◽

pp. 261-281 ◽

Cited By ~ 3

Author(s):

Eugene W. Stark

Keyword(s):

Dataflow Networks

Download Full-text

Linear logic and interference control

Category Theory and Computer Science - Lecture Notes in Computer Science ◽

10.1007/bfb0013458 ◽

2005 ◽

pp. 74-93 ◽

Cited By ~ 9

Author(s):

P. W. O'Hearn

Keyword(s):

Linear Logic ◽

Interference Control

Download Full-text

Local variables and non-interference in algol-like languages

Category Theory and Computer Science - Lecture Notes in Computer Science ◽

10.1007/bfb0013455 ◽

2005 ◽

pp. 34-36

Author(s):

R. D. Tennent

Download Full-text

Applications of the calculus of trees to process description languages

Category Theory and Computer Science - Lecture Notes in Computer Science ◽

10.1007/bfb0013471 ◽

2005 ◽

pp. 282-301 ◽

Cited By ~ 2

Author(s):

P. Degano ◽

S. Kasangian ◽

S. Vigna

Keyword(s):

Description Languages

Download Full-text

Constructions and predicates

Category Theory and Computer Science - Lecture Notes in Computer Science ◽

10.1007/bfb0013466 ◽

2005 ◽

pp. 173-196 ◽

Cited By ~ 1

Author(s):

Duško Pavlović

Download Full-text

BCK-formulas having unique proofs

Category Theory and Computer Science - Lecture Notes in Computer Science ◽

10.1007/bfb0013460 ◽

2005 ◽

pp. 106-120 ◽

Cited By ~ 1

Author(s):

Sachio Hirokawa

Download Full-text

Bifinite domains: Stable case

Category Theory and Computer Science - Lecture Notes in Computer Science ◽

10.1007/bfb0013454 ◽

2005 ◽

pp. 16-33 ◽

Cited By ~ 5

Author(s):

Roberto M. Amadio

Keyword(s):

Stable Case

Download Full-text

Two results on set-theoretic polymorphism

Category Theory and Computer Science - Lecture Notes in Computer Science ◽

10.1007/bfb0013468 ◽

2005 ◽

pp. 219-235 ◽

Cited By ~ 3

Author(s):

Wesley Phoa

Download Full-text

Category Theory and Computer Science - Lecture Notes in Computer ScienceLatest Publications

TOTAL DOCUMENTS

H-INDEX

Published By Springer-Verlag

Proof nets and coherence theorems

Stone duality for stable functions

Dataflow networks are fibrations

Linear logic and interference control

Local variables and non-interference in algol-like languages

Applications of the calculus of trees to process description languages

Constructions and predicates

BCK-formulas having unique proofs

Bifinite domains: Stable case

Two results on set-theoretic polymorphism

Category Theory and Computer Science - Lecture Notes in Computer Science
Latest Publications