


default search action
Formal Description of Programming Concepts 1987: Ebberup, Denmark
- Martin Wirsing:

Formal Description of Programming Concepts - III: Proceedings of the IFIP TC 2/WG 2.2 Working Conference on Formal Description of Programming Concepts - III, Ebberup, Denmark, 25-28 August 1986. North-Holland 1987, ISBN 0-444-70253-9
Session 1: Logic of Programs
- Grazyna Mirkowska, Andrzej Salwicki:

Axiomatic definability of programming language semantics. Formal Description of Programming Concepts 1987: 3-22 - Frank S. de Boer:

A proof rule for process-creation. Formal Description of Programming Concepts 1987: 23-52
Session 2: Concurrency I
- Jos C. M. Baeten, Jan A. Bergstra, Jan Willem Klop:

Conditional axioms and α/β-calculus in process algebra. Formal Description of Programming Concepts 1987: 53-76 - Jan A. Bergstra, Jan Willem Klop, Ernst-Rüdiger Olderog:

Failures without chaos: a new process semantics for fair abstraction. Formal Description of Programming Concepts 1987: 77-104 - Pierpaolo Degano, Rocco De Nicola, Ugo Montanari:

Observational equivalences for concurrency models. Formal Description of Programming Concepts 1987: 105-134
Session 3: Semantics
- Peter D. Mosses, David A. Watt:

The use of action semantics. Formal Description of Programming Concepts 1987: 135-166 - Sarangapani Jagannathan:

A model of data backup and recovery in a computer system for functional programming. Formal Description of Programming Concepts 1987: 167-192 - Matthias Felleisen, Daniel P. Friedman:

Control operators, the SECD-machine, and the λ-calculus. Formal Description of Programming Concepts 1987: 193-222
Session 4: Term Rewriting and Logic Programming
- Jean-Pierre Jouannaud, B. Waldmann:

Reductive conditional term rewriting systems. Formal Description of Programming Concepts 1987: 223-244 - Saumya K. Debray, Prateek Mishra:

Denotational and operational semantics for PROLOG. Formal Description of Programming Concepts 1987: 245-274 - Joxan Jaffar, Jean-Louis Lassez, Michael J. Maher:

PROLOG - II as an instance of the logic programming language scheme. Formal Description of Programming Concepts 1987: 275-298
Session 5: Concurrency II
- Eike Best, Raymond Devillers:

Interleaving and partial orders in concurrency: a formal comparison. Formal Description of Programming Concepts 1987: 299-324 - M. Chadili, Irène Guessarian:

Notions of fairness for synchronous fork join nets. Formal Description of Programming Concepts 1987: 325-346 - Scott A. Smolka, Robert E. Strom:

A CCS semantics for NIL. Formal Description of Programming Concepts 1987: 347-376
Session 6: High Order Programming
- Roberto M. Amadio, Giuseppe Longo:

Type-free compiling of parametric types. Formal Description of Programming Concepts 1987: 377-398 - Susumu Hayashi:

PX: a system extracting programs from proofs. Formal Description of Programming Concepts 1987: 399-424 - Mariangiola Dezani-Ciancaglini, Ines Margaria:

Polymorphic types, fixed-point combinators and continuous lambda-models. Formal Description of Programming Concepts 1987: 425-450

manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.


Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID














