|
1
|
Lambda Calculus
– C. -h. L. Ong, C C. -h. L. Ong
|
|
43
|
Presheaf Models for Concurrency
– Gian Luca Cattani
- 1999
|
|
33
|
Relational interpretations of recursive types in an operational setting
– Lars Birkedal, Robert Harper
- 1997
|
|
|
Type Theory for Programming Languages
– Robert Harper
- 1994
|
|
7
|
Dynamic Slicing In Higher-Order Programming Languages
– Sandip K. Biswas, Carl A. Gunter, Insup Lee
- 1997
|
|
|
Process Logic and Duality -- Part I: Sequential Processes
– Kohei Honda
|
|
20
|
Domain theory for concurrency
– Mikkel Nygaard
- 2003
|
|
37
|
A Coinduction Principle for Recursive Data Types Based on Bisimulation
– Marcelo P. Fiore
- 1996
|
|
1
|
The Varieties of Programming Language Semantics And Their Uses
– Peter D. Mosses
- 2001
|
|
7
|
Partial computations in constructive type theory
– Scott F. Smith
- 1991
|
|
|
Introduction to Type Theory
– Herman Geuvers
|
|
1
|
Reasoning about Selective Strictness -- Operational Equivalence, Heaps and Call-by-Need Evaluation, New Inductive Principles
– Seyed H. Haeri
- 2009
|
|
|
Reasoning about Selective Strictness -- Operational Equivalence, Heaps and Call-by-Need Evaluation, New Inductive Principles
– Seyed H. Haeri (Hossein)
- 2009
|
|
17
|
Solving Recursive Domain Equations with Enriched Categories
– Kim Ritter Wagner, Stephen Brookes, John C. Reynolds
- 1994
|
|
8
|
Topology, Domain Theory and Theoretical Computer Science
– Michael W. Mislove
- 1997
|
|
12
|
Programming Metalogics with a Fixpoint Type
– Roy Louis Crole, C Fl Roy Louis Crole, Prof E. Moggi
- 1992
|
|
29
|
On the Foundations of Final Coalgebra Semantics: non-well-founded sets, partial orders, metric spaces
– Daniele Turi, Jan Rutten
- 1998
|
|
11
|
Programming Language Semantics
– David A. Schmidt
- 1995
|
|
1
|
Semantics, Modularity, and Rewriting Logic
– Peter D. Mosses, Peter D. Mosses
- 1998
|
