Lecture Notes in Computer Science - Foundations of Software Science and Computation Structures
Latest Publications

TOTAL DOCUMENTS

(FIVE YEARS 0)

H-INDEX

(FIVE YEARS 0)

Published By Springer Berlin Heidelberg

9783540672579, 9783540464327

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

The State Explosion Problem from Trace to Bisimulation Equivalence

Lecture Notes in Computer Science - Foundations of Software Science and Computation Structures ◽

10.1007/3-540-46432-8_13 ◽

2000 ◽

pp. 192-207 ◽

Cited By ~ 21

Author(s):

François Laroussinie ◽

Philippe Schnoebelen

Keyword(s):

The State ◽

State Explosion ◽

State Explosion Problem ◽

Bisimulation Equivalence

Download Full-text

A Program Refinement Framework Supporting Reasoning about Knowledge and Time

Lecture Notes in Computer Science - Foundations of Software Science and Computation Structures ◽

10.1007/3-540-46432-8_8 ◽

2000 ◽

pp. 114-129 ◽

Cited By ~ 7

Author(s):

Kai Engelhardt ◽

Ron van der Meyden ◽

Yoram Moses

Keyword(s):

Reasoning About Knowledge

Download Full-text

Categorical Models for Intuitionistic and Linear Type Theory

Lecture Notes in Computer Science - Foundations of Software Science and Computation Structures ◽

10.1007/3-540-46432-8_15 ◽

2000 ◽

pp. 223-237 ◽

Cited By ~ 3

Author(s):

Maria Emilia Maietti ◽

Valeria de Paiva ◽

Eike Ritter

Keyword(s):

Type Theory ◽

Linear Type ◽

Categorical Models

Download Full-text

Proof Nets and Explicit Substitutions

Lecture Notes in Computer Science - Foundations of Software Science and Computation Structures ◽

10.1007/3-540-46432-8_5 ◽

2000 ◽

pp. 63-81 ◽

Cited By ~ 6

Author(s):

Roberto Di Cosmo ◽

Delia Kesner ◽

Emmanuel Polonovski

Keyword(s):

Explicit Substitutions ◽

Proof Nets

Download Full-text

Type Inference for First-Order Logic

Lecture Notes in Computer Science - Foundations of Software Science and Computation Structures ◽

10.1007/3-540-46432-8_20 ◽

2000 ◽

pp. 297-313

Author(s):

Aleksy Schubert

Keyword(s):

Order Logic ◽

Type Inference ◽

First Order Logic ◽

First Order

Download Full-text

On Word Rewriting Systems Having a Rational Derivation

Lecture Notes in Computer Science - Foundations of Software Science and Computation Structures ◽

10.1007/3-540-46432-8_4 ◽

2000 ◽

pp. 48-62 ◽

Cited By ~ 7

Author(s):

Didier Caucal

Keyword(s):

Rewriting Systems

Download Full-text

A Higher-Order Simulation Relation for System F

Lecture Notes in Computer Science - Foundations of Software Science and Computation Structures ◽

10.1007/3-540-46432-8_9 ◽

2000 ◽

pp. 130-145 ◽

Cited By ~ 4

Author(s):

Jo Erskine Hannay

Keyword(s):

Higher Order ◽

System F ◽

Simulation Relation

Download Full-text

Locality and Polyadicity in Asynchronous Name-Passing Calculi

Lecture Notes in Computer Science - Foundations of Software Science and Computation Structures ◽

10.1007/3-540-46432-8_16 ◽

2000 ◽

pp. 238-251 ◽

Cited By ~ 4

Author(s):

Massimo Merro

Download Full-text

On Rational Graphs

Lecture Notes in Computer Science - Foundations of Software Science and Computation Structures ◽

10.1007/3-540-46432-8_17 ◽

2000 ◽

pp. 252-266 ◽

Cited By ~ 25

Author(s):

Christophe Morvan

Download Full-text

On Synchronous and Asynchronous Mobile Processes

Lecture Notes in Computer Science - Foundations of Software Science and Computation Structures ◽

10.1007/3-540-46432-8_19 ◽

2000 ◽

pp. 283-296 ◽

Cited By ~ 6

Author(s):

Paola Quaglia ◽

David Walker

Keyword(s):

Mobile Processes

Download Full-text

Lecture Notes in Computer Science - Foundations of Software Science and Computation StructuresLatest Publications

TOTAL DOCUMENTS

H-INDEX

Published By Springer Berlin Heidelberg

The State Explosion Problem from Trace to Bisimulation Equivalence

A Program Refinement Framework Supporting Reasoning about Knowledge and Time

Categorical Models for Intuitionistic and Linear Type Theory

Proof Nets and Explicit Substitutions

Type Inference for First-Order Logic

On Word Rewriting Systems Having a Rational Derivation

A Higher-Order Simulation Relation for System F

Locality and Polyadicity in Asynchronous Name-Passing Calculi

On Rational Graphs

On Synchronous and Asynchronous Mobile Processes

Lecture Notes in Computer Science - Foundations of Software Science and Computation Structures
Latest Publications