Preface to special issue: EXPRESS, ICE and SOS 2009

2012 ◽  
Vol 22 (2) ◽  
pp. 123-124
Author(s):  
FILIPPO BONCHI ◽  
SIBYLLE FRÖSCHLE ◽  
DANIELE GORLA ◽  
BARTEK KLIN
Keyword(s):  
Computer Science ◽  
International Workshop ◽  
Operational Semantics ◽  
Special Issue ◽  
Mathematical Structures ◽  
Structural Operational Semantics ◽  
Selection Of

This special issue of Mathematical Structures in Computer Science contains a selection of papers presented at three satellite events of CONCUR'09, which was held between 31 August and 5 September 2009 in Bologna (Italy). Specifically, it contains three papers from the 16th International Workshop on Expressiveness in Concurrency (EXPRESS'09), one paper from the 2nd Interaction and Concurrency Experience (ICE'09) and two papers from the 6th Workshop on Structural Operational Semantics (SOS'09).

scholarly journals Preface to special issue: EXPRESS 2010

2014 ◽  
Vol 26 (6) ◽  
pp. 907-907
Author(s):  
SIBYLLE FRÖSCHLE ◽  
FRANK D. VALENCIA
Keyword(s):  
Computer Science ◽  
International Workshop ◽  
Special Issue ◽  
Mathematical Structures ◽  
Selection Of

This issue of Mathematical Structures in Computer Science contains a selection of papers presented at the 17th International Workshop on Expressiveness in Concurrency (EXPRESS'10), a satellite event of CONCUR'10, held on August 30th in Paris, France.

scholarly journals Preface to special issue: EXPRESS 2011

2014 ◽  
Vol 26 (8) ◽  
pp. 1351-1351
Author(s):  
BAS LUTTIK ◽  
FRANK D. VALENCIA
Keyword(s):  
Computer Science ◽  
International Workshop ◽  
Special Issue ◽  
Mathematical Structures ◽  
Selection Of

This issue of Mathematical Structures in Computer Science contains a selection of papers presented at the 18th International Workshop on Expressiveness in Concurrency (EXPRESS'11), a satellite event of CONCUR'11, held on September 5th, 2011 in Aachen, Germany.

Introduction to special issue on concurrency and coordination: Selected work from the International Workshop ConCoord

2004 ◽  
Vol 14 (3) ◽  
pp. 283-283
Author(s):  
VLADIMIRO SASSONE
Keyword(s):  
Computer Science ◽  
International Workshop ◽  
Wide Area ◽  
Area Network ◽  
Network Programming ◽  
Wide Area Network ◽  
Special Issue ◽  
Mathematical Structures

This Special Issue of Mathematical Structures in Computer Science contains selected papers from ConCoord, the International Workshop on Concurrency and Coordination held in Lipari, Italy, on July 6–8, 2001 and associated to the 13th Lipari School for Computer Science Researchers on the Foundations of Wide Area Network Programming.

scholarly journals Preface to special issue: ICTAC 2015

2018 ◽  
Vol 29 (1) ◽  
pp. 1-2
Author(s):  
MARTIN LEUCKER ◽  
JORGE A. PÉREZ ◽  
CAMILO RUEDA ◽  
FRANK D. VALENCIA
Keyword(s):  
Computer Science ◽  
Special Issue ◽  
International Colloquium ◽  
Mathematical Structures ◽  
Selection Of

This issue of Mathematical Structures in Computer Science (MSCS) contains a selection of papers presented at the 12th International Colloquium on Theoretical Aspects of Computing (ICTAC 2015), which took place in Cali, Colombia, on October 29–31, 2015.

scholarly journals Foreword

1997 ◽  
Vol 7 (5) ◽  
pp. 399-400
Author(s):  
MICHAEL HUTH ◽  
ACHIM JUNG ◽  
KLAUS KEIMEL
Keyword(s):  
Computer Science ◽  
Programming Languages ◽  
International Workshop ◽  
Special Issue ◽  
Mathematical Structures

This special issue of Mathematical Structures in Computer Science is devoted to the Proceedings of the International Workshop Logic, Domains, and Programming Languages that took place from May 24 to 27, 1995, in Darmstadt, Germany.

scholarly journals Preface to special issue: Expressiveness in Concurrency 2008

2010 ◽  
Vol 20 (1) ◽  
pp. 1-2
Author(s):  
THOMAS HILDEBRANDT ◽  
DANIELE GORLA
Keyword(s):  
Computer Science ◽  
International Workshop ◽  
Special Issue ◽  
Mathematical Structures

This issue of Mathematical Structures in Computer Science contains three papers selected from the 15th International Workshop on Expressiveness in Concurrency (EXPRESS'08) held on 23 August 2008 in Toronto (Canada) as a satellite event of CONCUR'08.

scholarly journals Special issue on quantum programming languages

2006 ◽  
Vol 16 (3) ◽  
pp. 373-374
Author(s):  
PETER SELINGER
Keyword(s):  
Quantum Computing ◽  
Computer Science ◽  
Programming Languages ◽  
Quantum Computation ◽  
International Workshop ◽  
Special Issue ◽  
Mathematical Structures ◽  
Quantum Programming Languages ◽  
Quantum Programming

This special issue of Mathematical Structures in Computer Science grew out of the 2nd International Workshop on Quantum Programming Languages (QPL 2004), which was held July 12–13, 2004 in Turku, Finland. The purpose of the workshop was to bring together researchers working on mathematical formalisms and programming languages for quantum computing. It was the second in a series of workshops aimed at addressing a growing interest in logical tools, languages, and semantical methods for analysing quantum computation.

scholarly journals Preface

2011 ◽  
Vol 21 (4) ◽  
pp. 671-677 ◽  
Author(s):  
GÉRARD HUET
Keyword(s):  
Mathematical Logic ◽  
Computer Science ◽  
20Th Century ◽  
Theorem Proving ◽  
Propositional Calculus ◽  
Interactive Theorem Proving ◽  
Predicate Calculus ◽  
Special Issue ◽  
Mathematical Structures ◽  
Infinite Domains

This special issue of Mathematical Structures in Computer Science is devoted to the theme of ‘Interactive theorem proving and the formalisation of mathematics’.The formalisation of mathematics started at the turn of the 20th century when mathematical logic emerged from the work of Frege and his contemporaries with the invention of the formal notation for mathematical statements called predicate calculus. This notation allowed the formulation of abstract general statements over possibly infinite domains in a uniform way, and thus went well beyond propositional calculus, which goes back to Aristotle and only allowed tautologies over unquantified statements.

scholarly journals Preface to special issue: lightweight and practical formal methods in the design and analysis of safety-critical systems

2013 ◽  
Vol 23 (4) ◽  
pp. 675-675
Author(s):  
AZER BESTAVROS ◽  
ASSAF KFOURY
Keyword(s):  
Computer Science ◽  
Formal Methods ◽  
Wide Spectrum ◽  
Critical Systems ◽  
Research Groups ◽  
Special Issue ◽  
Mathematical Structures ◽  
Safety Critical ◽  
Safety Critical Systems ◽  
Final Selection

The papers included in this special issue of Mathematical Structures in Computer Science were selected from a larger set we solicited from leading research groups on both sides of the Atlantic. They cover a wide spectrum of tutorials, recent results and surveys in the area of lightweight and practical formal methods in the design and analysis of safety-critical systems. All the papers we received were submitted to a rigorous process of review and revision, based on which we made our final selection.

scholarly journals On the foundations of final coalgebra semantics: non-well-founded sets, partial orders, metric spaces

1998 ◽  
Vol 8 (5) ◽  
pp. 481-540 ◽  
Author(s):  
DANIELE TURI ◽  
JAN RUTTEN
Keyword(s):  
Computer Science ◽  
Mathematical Theory ◽  
Metric Spaces ◽  
Operational Semantics ◽  
Denotational Semantics ◽  
Partial Orders ◽  
Present Survey ◽  
Induction Principle ◽  
Structural Operational Semantics ◽  
Modern Mathematics

This paper, a revised version of Rutten and Turi (1993), is part of a programme aiming at formulating a mathematical theory of structural operational semantics to complement the established theory of domains and denotational semantics to form a coherent whole (Turi 1996; Turi and Plotkin 1997). The programme is based on a suitable interplay between the induction principle, which pervades modern mathematics, and a dual, non-standard ‘coinduction principle’, which underlies many of the recursive phenomena occurring in computer science.The aim of the present survey is to show that the elementary categorical notion of a final coalgebra is a suitable foundation for such a coinduction principle. The properties of coalgebraic coinduction are studied both at an abstract categorical level and in some specific categories used in semantics, namely categories of non-well-founded sets, partial orders and metric spaces.

Sign in / Sign up

Export Citation Format

Share Document