Lecture Notes in Computer Science - Mathematics of Program Construction
Latest Publications

TOTAL DOCUMENTS

(FIVE YEARS 0)

H-INDEX

(FIVE YEARS 0)

Published By Springer Berlin Heidelberg

9783540705932, 9783540705949

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Unfolding Abstract Datatypes

Lecture Notes in Computer Science - Mathematics of Program Construction ◽

10.1007/978-3-540-70594-9_8 ◽

2008 ◽

pp. 110-133 ◽

Cited By ~ 1

Author(s):

Jeremy Gibbons

Download Full-text

Symmetric and Synchronous Communication in Peer-to-Peer Networks

Lecture Notes in Computer Science - Mathematics of Program Construction ◽

10.1007/978-3-540-70594-9_21 ◽

2008 ◽

pp. 404-421

Author(s):

Andreas Witzel

Keyword(s):

Peer To Peer ◽

Peer Networks ◽

Synchronous Communication ◽

Peer To Peer Networks

Download Full-text

Algebra of Programming Using Dependent Types

Lecture Notes in Computer Science - Mathematics of Program Construction ◽

10.1007/978-3-540-70594-9_15 ◽

2008 ◽

pp. 268-283 ◽

Cited By ~ 4

Author(s):

Shin-Cheng Mu ◽

Hsiang-Shang Ko ◽

Patrik Jansson

Keyword(s):

Dependent Types ◽

Algebra Of Programming

Download Full-text

Zippy Tabulations of Recursive Functions

Lecture Notes in Computer Science - Mathematics of Program Construction ◽

10.1007/978-3-540-70594-9_7 ◽

2008 ◽

pp. 92-109 ◽

Cited By ~ 1

Author(s):

Richard S. Bird

Keyword(s):

Recursive Functions

Download Full-text

Scrap Your Type Applications

Lecture Notes in Computer Science - Mathematics of Program Construction ◽

10.1007/978-3-540-70594-9_2 ◽

2008 ◽

pp. 2-27 ◽

Cited By ~ 2

Author(s):

Barry Jay ◽

Simon Peyton Jones

Download Full-text

A Hoare Logic for Call-by-Value Functional Programs

Lecture Notes in Computer Science - Mathematics of Program Construction ◽

10.1007/978-3-540-70594-9_17 ◽

2008 ◽

pp. 305-335 ◽

Cited By ~ 18

Author(s):

Yann Régis-Gianas ◽

François Pottier

Keyword(s):

Hoare Logic ◽

Value Functional

Download Full-text

Probabilistic Choice in Refinement Algebra

Lecture Notes in Computer Science - Mathematics of Program Construction ◽

10.1007/978-3-540-70594-9_14 ◽

2008 ◽

pp. 243-267 ◽

Cited By ~ 1

Author(s):

Larissa Meinicke ◽

Ian J. Hayes

Keyword(s):

Probabilistic Choice

Download Full-text

Synthesis of Optimal Control Policies for Some Infinite-State Transition Systems

Lecture Notes in Computer Science - Mathematics of Program Construction ◽

10.1007/978-3-540-70594-9_18 ◽

2008 ◽

pp. 336-359 ◽

Cited By ~ 3

Author(s):

Michel Sintzoff

Keyword(s):

Optimal Control ◽

State Transition ◽

Transition Systems ◽

Control Policies ◽

Infinite State ◽

State Transition Systems

Download Full-text

Verifying a Semantic βη-Conversion Test for Martin-Löf Type Theory

Lecture Notes in Computer Science - Mathematics of Program Construction ◽

10.1007/978-3-540-70594-9_4 ◽

2008 ◽

pp. 29-56 ◽

Cited By ~ 14

Author(s):

Andreas Abel ◽

Thierry Coquand ◽

Peter Dybjer

Keyword(s):

Type Theory

Download Full-text

The Böhm–Jacopini Theorem Is False, Propositionally

Lecture Notes in Computer Science - Mathematics of Program Construction ◽

10.1007/978-3-540-70594-9_11 ◽

2008 ◽

pp. 177-192 ◽

Cited By ~ 3

Author(s):

Dexter Kozen ◽

Wei-Lung Dustin Tseng

Download Full-text

Lecture Notes in Computer Science - Mathematics of Program ConstructionLatest Publications

TOTAL DOCUMENTS

H-INDEX

Published By Springer Berlin Heidelberg

Unfolding Abstract Datatypes

Symmetric and Synchronous Communication in Peer-to-Peer Networks

Algebra of Programming Using Dependent Types

Zippy Tabulations of Recursive Functions

Scrap Your Type Applications

A Hoare Logic for Call-by-Value Functional Programs

Probabilistic Choice in Refinement Algebra

Synthesis of Optimal Control Policies for Some Infinite-State Transition Systems

Verifying a Semantic βη-Conversion Test for Martin-Löf Type Theory

The Böhm–Jacopini Theorem Is False, Propositionally

Lecture Notes in Computer Science - Mathematics of Program Construction
Latest Publications