Conferences in DBLP

TAPSOFT (tapsoft)
1985 (conf/tapsoft/1985-1)

1. Manfred Broy
   Specification and Top Down Design of Distributed Systems. [Citation Graph (0, 0)][DBLP]
   TAPSOFT, Vol.1, 1985, pp:4-28 [Conf]
   
2. Pierpaolo Degano, Ugo Montanari
   Specification Languages for Distributed Systems. [Citation Graph (0, 0)][DBLP]
   TAPSOFT, Vol.1, 1985, pp:29-51 [Conf]
   
3. William L. Scherlis, Dana S. Scott
   Semantically Based Programming Tools (Summary). [Citation Graph (0, 0)][DBLP]
   TAPSOFT, Vol.1, 1985, pp:52-59 [Conf]
   
4. John W. Backus
   From Function Level Semantics to Program Transformation and Optimization. [Citation Graph (2, 0)][DBLP]
   TAPSOFT, Vol.1, 1985, pp:60-91 [Conf]
   
5. Rod M. Burstall
   Inductively Defined Functions (Extended Abstract). [Citation Graph (0, 0)][DBLP]
   TAPSOFT, Vol.1, 1985, pp:92-96 [Conf]
   
6. John C. Reynolds
   Three Approaches to Type Structure. [Citation Graph (1, 0)][DBLP]
   TAPSOFT, Vol.1, 1985, pp:97-138 [Conf]
   
7. Marco Protasi, Maurizio Talamo
   On the Maximum Size of Random Trees. [Citation Graph (0, 0)][DBLP]
   TAPSOFT, Vol.1, 1985, pp:139-144 [Conf]
   
8. Bernard Chazelle
   Fast Searching in a Real Algebraic Manifold with Applications to Geometric Complexity. [Citation Graph (0, 0)][DBLP]
   TAPSOFT, Vol.1, 1985, pp:145-156 [Conf]
   
9. Pierre-Louis Curien
   Typed Categorial Combinatory Logic. [Citation Graph (0, 0)][DBLP]
   TAPSOFT, Vol.1, 1985, pp:157-172 [Conf]
   
10. Deepak Kapur, Paliath Narendran, G. Sivakumar
    A Path Ordering for Proving Termination of Term Rewriting Systems. [Citation Graph (0, 0)][DBLP]
    TAPSOFT, Vol.1, 1985, pp:173-187 [Conf]
    
11. Deepak Kapur, Mandayam K. Srivas
    A Rewrite Rule Based Approach for Synthesizing Abstract Data Types. [Citation Graph (1, 0)][DBLP]
    TAPSOFT, Vol.1, 1985, pp:188-207 [Conf]
    
12. Michael Karr
    "Delayability" in Proofs of Strong Normalizability in the Typed Lambda Calculus. [Citation Graph (0, 0)][DBLP]
    TAPSOFT, Vol.1, 1985, pp:208-222 [Conf]
    
13. Ilaria Castellani
    Bisimulations and Abstraction Homomorphisms. [Citation Graph (0, 0)][DBLP]
    TAPSOFT, Vol.1, 1985, pp:223-238 [Conf]
    
14. Gerardo Costa
    A Metric Characterization of Fair Computations in CCS. [Citation Graph (0, 0)][DBLP]
    TAPSOFT, Vol.1, 1985, pp:239-252 [Conf]
    
15. Colin Sterling
    A Complete Modal Proof System for a Subset of SCCS. [Citation Graph (0, 0)][DBLP]
    TAPSOFT, Vol.1, 1985, pp:253-266 [Conf]
    
16. Paul Boehm, Harald-Reto Fonio, Annegret Habel
    Amalgamation of Graph Transformations with Applications to Synchronization. [Citation Graph (0, 0)][DBLP]
    TAPSOFT, Vol.1, 1985, pp:267-283 [Conf]
    
17. Ulrike Lichtblau
    Decompilation of Control Structures by Means of Graph Transformations. [Citation Graph (0, 0)][DBLP]
    TAPSOFT, Vol.1, 1985, pp:284-297 [Conf]
    
18. Emanuela Fachini, Margherita Napoli
    Synchronized Bottom-Up Tree Automata and L-Systems. [Citation Graph (0, 0)][DBLP]
    TAPSOFT, Vol.1, 1985, pp:298-307 [Conf]
    
19. Donald Sannella, Andrzej Tarlecki
    On Observational Equivalence and Algebraic Specification. [Citation Graph (0, 0)][DBLP]
    TAPSOFT, Vol.1, 1985, pp:308-322 [Conf]
    
20. Peter Padawitz
    Parameter Preserving Data Type Specifications. [Citation Graph (0, 0)][DBLP]
    TAPSOFT, Vol.1, 1985, pp:323-341 [Conf]
    
21. Egidio Astesiano, Gianfranco Mascari, Gianna Reggio, Martin Wirsing
    On the Parameterized Algebraic Specification of Concurrent Systems. [Citation Graph (0, 0)][DBLP]
    TAPSOFT, Vol.1, 1985, pp:342-358 [Conf]
    
22. Edward K. Blum, Francesco Parisi-Presicce
    The Semantics of Shared Submodules Specifications. [Citation Graph (0, 0)][DBLP]
    TAPSOFT, Vol.1, 1985, pp:359-373 [Conf]
    
23. Johann A. Makowsky
    Why Horn Formulas Matter in Computer Science: Initial Structures and Generic Examples (Extended Abstract). [Citation Graph (1, 0)][DBLP]
    TAPSOFT, Vol.1, 1985, pp:374-387 [Conf]
    
24. Axel Poigné, Josef Voss
    On the Implementation of Abstract Data Types by Programming Language Constructs. [Citation Graph (0, 0)][DBLP]
    TAPSOFT, Vol.1, 1985, pp:388-402 [Conf]
    
25. Christine Choppy, G. Guiho, Stéphane Kaplan
    A Lisp Compiler for FP Language and Its Proof via Algebraic Semantics. [Citation Graph (0, 0)][DBLP]
    TAPSOFT, Vol.1, 1985, pp:403-415 [Conf]