Lecture Notes in Computer Science - Mathematical Foundations of Programming Semantics
Latest Publications

TOTAL DOCUMENTS

(FIVE YEARS 0)

H-INDEX

(FIVE YEARS 0)

Published By Springer Berlin Heidelberg

9783540555117, 9783540471943

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Trade-offs in true concurrency: Pomsets and mazurkiewicz traces

Lecture Notes in Computer Science - Mathematical Foundations of Programming Semantics ◽

10.1007/3-540-55511-0_18 ◽

1992 ◽

pp. 350-375 ◽

Cited By ~ 4

Author(s):

Bard Bloom ◽

Marta Kwiatkowska

Keyword(s):

True Concurrency ◽

Trade Offs ◽

Mazurkiewicz Traces

Cartesian closed categories of domains and the space proj(D)

Lecture Notes in Computer Science - Mathematical Foundations of Programming Semantics ◽

10.1007/3-540-55511-0_13 ◽

1992 ◽

pp. 259-271 ◽

Cited By ~ 1

Author(s):

Michael Huth

Keyword(s):

Cartesian Closed Categories ◽

Cartesian Closed

An upper power domain construction in terms of strongly compact sets

Lecture Notes in Computer Science - Mathematical Foundations of Programming Semantics ◽

10.1007/3-540-55511-0_14 ◽

1992 ◽

pp. 272-293 ◽

Cited By ~ 12

Author(s):

Reinhold Heckmann

Keyword(s):

Compact Sets ◽

Power Domain

Typed homomorphic relations extended with subtypes

Lecture Notes in Computer Science - Mathematical Foundations of Programming Semantics ◽

10.1007/3-540-55511-0_7 ◽

1992 ◽

pp. 144-167 ◽

Cited By ~ 4

Author(s):

Gary T. Leavens ◽

Don Pigozzi

An exper model for Quest

Lecture Notes in Computer Science - Mathematical Foundations of Programming Semantics ◽

10.1007/3-540-55511-0_22 ◽

1992 ◽

pp. 436-445

Author(s):

G. Rosolini

A monoidal closed category of event structures

Lecture Notes in Computer Science - Mathematical Foundations of Programming Semantics ◽

10.1007/3-540-55511-0_21 ◽

1992 ◽

pp. 426-435 ◽

Cited By ~ 2

Author(s):

Guo-Qiang Zhang

Keyword(s):

Closed Category ◽

Event Structures ◽

Monoidal Closed Category

Correctness of procedure representations in higher-order assembly language

Lecture Notes in Computer Science - Mathematical Foundations of Programming Semantics ◽

10.1007/3-540-55511-0_15 ◽

1992 ◽

pp. 294-311 ◽

Cited By ~ 11

Author(s):

Mitchell Wand

Keyword(s):

Assembly Language ◽

Higher Order

Connections

Lecture Notes in Computer Science - Mathematical Foundations of Programming Semantics ◽

10.1007/3-540-55511-0_26 ◽

1992 ◽

pp. 492-506

Author(s):

Austin Melton ◽

Bernd S. W. Schröder ◽

George E. Strecker

Types, abstraction, and parametric polymorphism, part 2

Lecture Notes in Computer Science - Mathematical Foundations of Programming Semantics ◽

10.1007/3-540-55511-0_1 ◽

1992 ◽

pp. 1-40 ◽

Cited By ~ 25

Author(s):

QingMing Ma ◽

John C. Reynolds

Keyword(s):

Parametric Polymorphism

A simple language supporting angelic nondeterminism and parallel composition

Lecture Notes in Computer Science - Mathematical Foundations of Programming Semantics ◽

10.1007/3-540-55511-0_4 ◽

1992 ◽

pp. 77-101 ◽

Cited By ~ 1

Author(s):

Michael W. Mislove ◽

Prank J. Oles

Keyword(s):

Parallel Composition ◽

Simple Language

Lecture Notes in Computer Science - Mathematical Foundations of Programming SemanticsLatest Publications

TOTAL DOCUMENTS

H-INDEX

Published By Springer Berlin Heidelberg

Trade-offs in true concurrency: Pomsets and mazurkiewicz traces

Cartesian closed categories of domains and the space proj(D)

An upper power domain construction in terms of strongly compact sets

Typed homomorphic relations extended with subtypes

An exper model for Quest

A monoidal closed category of event structures

Correctness of procedure representations in higher-order assembly language

Connections

Types, abstraction, and parametric polymorphism, part 2

A simple language supporting angelic nondeterminism and parallel composition

Lecture Notes in Computer Science - Mathematical Foundations of Programming Semantics
Latest Publications