default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID1. TAPSOFT 1985: Berlin, Germany
- Hartmut Ehrig, Christiane Floyd, Maurice Nivat, James W. Thatcher:
Mathematical Foundations of Software Development, Proceedings of the International Joint Conference on Theory and Practice of Software Development (TAPSOFT), Berlin, Germany, March 25-29, 1985, Volume 1: Colloquium on Trees in Algebra and Programming (CAAP'85). Lecture Notes in Computer Science 185, Springer 1985, ISBN 3-540-15198-2
Advanced Seminar on the Role of Semantics in Software Development
Concepts of Semantics with a View to Software Development
- Manfred Broy:
Specification and Top Down Design of Distributed Systems. 4-28 - Pierpaolo Degano, Ugo Montanari:
Specification Languages for Distributed Systems. 29-51 - William L. Scherlis, Dana S. Scott:
Semantically Based Programming Tools (Summary). 52-59
The Role of Semantics in Language Design
- John W. Backus:
From Function Level Semantics to Program Transformation and Optimization. 60-91 - Rod M. Burstall:
Inductively Defined Functions (Extended Abstract). 92-96 - John C. Reynolds:
Three Approaches to Type Structure. 97-138
Colloquium on Trees in Algebra and Programming
Algorithms and Combinatorics
- Marco Protasi, Maurizio Talamo:
On the Maximum Size of Random Trees. 139-144 - Bernard Chazelle:
Fast Searching in a Real Algebraic Manifold with Applications to Geometric Complexity. 145-156 - Pierre-Louis Curien:
Typed Categorial Combinatory Logic. 157-172
Rewriting
- Deepak Kapur, Paliath Narendran, G. Sivakumar:
A Path Ordering for Proving Termination of Term Rewriting Systems. 173-187 - Deepak Kapur, Mandayam K. Srivas:
A Rewrite Rule Based Approach for Synthesizing Abstract Data Types. 188-207 - Michael Karr:
"Delayability" in Proofs of Strong Normalizability in the Typed Lambda Calculus. 208-222
Concurrency
- Ilaria Castellani
:
Bisimulations and Abstraction Homomorphisms. 223-238 - Gerardo Costa:
A Metric Characterization of Fair Computations in CCS. 239-252 - Colin Sterling:
A Complete Modal Proof System for a Subset of SCCS. 253-266
Graph Grammars and Formal Languages
- Paul Boehm, Harald-Reto Fonio, Annegret Habel:
Amalgamation of Graph Transformations with Applications to Synchronization. 267-283 - Ulrike Lichtblau:
Decompilation of Control Structures by Means of Graph Transformations. 284-297 - Emanuela Fachini, Margherita Napoli:
Synchronized Bottom-Up Tree Automata and L-Systems. 298-307
Specifications
- Donald Sannella, Andrzej Tarlecki:
On Observational Equivalence and Algebraic Specification. 308-322 - Peter Padawitz:
Parameter Preserving Data Type Specifications. 323-341 - Egidio Astesiano, Gianfranco Mascari, Gianna Reggio, Martin Wirsing:
On the Parameterized Algebraic Specification of Concurrent Systems. 342-358
Semantics and Data Types
- Edward K. Blum, Francesco Parisi-Presicce:
The Semantics of Shared Submodules Specifications. 359-373 - Johann A. Makowsky:
Why Horn Formulas Matter in Computer Science: Initial Structures and Generic Examples (Extended Abstract). 374-387 - Axel Poigné, Josef Voss:
On the Implementation of Abstract Data Types by Programming Language Constructs. 388-402 - Christine Choppy, G. Guiho, Stéphane Kaplan:
A Lisp Compiler for FP Language and Its Proof via Algebraic Semantics. 403-415
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.
last updated on 2024-11-15 19:20 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
