Conferences in DBLP

Mathematical Foundations of Programming Semantics (mfps)
1991 (conf/mfps/1991)

1. Qingming Ma, John C. Reynolds
   Types, Abstractions, and Parametric Polymorphism, Part 2. [Citation Graph (0, 0)][DBLP]
   MFPS, 1991, pp:1-40 [Conf]
   
2. John Gateley, Bruce F. Duba
   Call-by-Value Combinatory Logic and the Lambda-Value Calculus. [Citation Graph (0, 0)][DBLP]
   MFPS, 1991, pp:41-53 [Conf]
   
3. Scott F. Smith
   From Operational to Denotational Semantics. [Citation Graph (0, 0)][DBLP]
   MFPS, 1991, pp:54-76 [Conf]
   
4. Michael W. Mislove, Frank J. Oles
   A Simple Language Supporting Angelic Nondeterminism and Parallel Composition. [Citation Graph (0, 0)][DBLP]
   MFPS, 1991, pp:77-101 [Conf]
   
5. Kim B. Bruce
   The Equivalence of Two Semantic Definitions for Inheritance in Object-Oriented Languages. [Citation Graph (0, 0)][DBLP]
   MFPS, 1991, pp:102-124 [Conf]
   
6. Neal Nelson
   Primitive Recursive Functionals with Dependent Types. [Citation Graph (0, 0)][DBLP]
   MFPS, 1991, pp:125-143 [Conf]
   
7. Gary T. Leavens, Don Pigozzi
   Typed Homomorphic Relations Extended with Sybtypes. [Citation Graph (0, 0)][DBLP]
   MFPS, 1991, pp:144-167 [Conf]
   
8. Jon Barwise
   Information Links in Domain Theory. [Citation Graph (0, 0)][DBLP]
   MFPS, 1991, pp:168-192 [Conf]
   
9. Jan J. M. M. Rutten
   Nonwellfounded Sets and Programming Language Semantics. [Citation Graph (0, 0)][DBLP]
   MFPS, 1991, pp:193-206 [Conf]
   
10. John W. Gray
    Simultaneous Substitution in the Typed Lambda Calculus. [Citation Graph (0, 0)][DBLP]
    MFPS, 1991, pp:207-220 [Conf]
    
11. Michael Barr
    HSP Type Theorems in the Category of Posets. [Citation Graph (0, 0)][DBLP]
    MFPS, 1991, pp:221-234 [Conf]
    
12. Achim Jung, Leonid Libkin, Hermann Puhlmann
    Decomposition of Domains. [Citation Graph (0, 0)][DBLP]
    MFPS, 1991, pp:235-258 [Conf]
    
13. Michael Huth
    Cartesian Closed Categories of Domains and the Space Proj(D). [Citation Graph (0, 0)][DBLP]
    MFPS, 1991, pp:259-271 [Conf]
    
14. Reinhold Heckmann
    An Upper Power Domain Construction in Terms of Strongly Compact Sets. [Citation Graph (0, 0)][DBLP]
    MFPS, 1991, pp:272-293 [Conf]
    
15. Mitchell Wand
    Correctness of Procedure Representations in Higher-Order Assembly Language. [Citation Graph (0, 0)][DBLP]
    MFPS, 1991, pp:294-311 [Conf]
    
16. Nicolas Mercouroff
    An Algorithm for Analyzing Communicating Processes. [Citation Graph (0, 0)][DBLP]
    MFPS, 1991, pp:312-325 [Conf]
    
17. Stephen D. Brookes, Shai Geva
    Continuous Functions and Parallel Algorithms on Concrete Data Structures. [Citation Graph (0, 0)][DBLP]
    MFPS, 1991, pp:326-349 [Conf]
    
18. Bard Bloom, Marta Z. Kwiatkowska
    Trade-Offs in True Concurrency: Pomsets and Mazurkiewicz Traces. [Citation Graph (0, 0)][DBLP]
    MFPS, 1991, pp:350-375 [Conf]
    
19. Luca Aceto
    On Relating Concurency and Nondeterminism. [Citation Graph (0, 0)][DBLP]
    MFPS, 1991, pp:376-402 [Conf]
    
20. Stefano Kasangian, Anna Labella
    On Continuous Time Agents. [Citation Graph (0, 0)][DBLP]
    MFPS, 1991, pp:403-425 [Conf]
    
21. Guo-Qiang Zhang
    A Monoidal Closed Category of Event Structures. [Citation Graph (0, 0)][DBLP]
    MFPS, 1991, pp:426-435 [Conf]
    
22. Giuseppe Rosolini
    An Exper Model for Quest. [Citation Graph (0, 0)][DBLP]
    MFPS, 1991, pp:436-445 [Conf]
    
23. Ernest G. Manes
    Equations for if-then-else. [Citation Graph (0, 0)][DBLP]
    MFPS, 1991, pp:446-456 [Conf]
    
24. Stephen L. Bloom, Zoltán Ésik
    Program Correctness and Matricial Iteration Theories. [Citation Graph (0, 0)][DBLP]
    MFPS, 1991, pp:457-476 [Conf]
    
25. Nils Klarlund
    Liminf Progress Measures. [Citation Graph (0, 0)][DBLP]
    MFPS, 1991, pp:477-491 [Conf]
    
26. Austin Melton, Bernd S. W. Schröder, George E. Strecker
    Connections. [Citation Graph (0, 0)][DBLP]
    MFPS, 1991, pp:492-506 [Conf]