Isolating side effects in sequential languages
POPL '95 Proceedings of the 22nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Semantics: the description of computational structures
ACM Computing Surveys (CSUR) - Special issue: position statements on strategic directions in computing research
From Algol to polymorphic linear lambda-calculus
Journal of the ACM (JACM)
Theoretical Computer Science
Relative definability of boolean functions via hypergraphs
Theoretical Computer Science
Information and Computation
Lambda Definability with Sums via Grothendieck Logical Relations
TLCA '99 Proceedings of the 4th International Conference on Typed Lambda Calculi and Applications
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
Operational Semantics and Program Equivalence
Applied Semantics, International Summer School, APPSEM 2000, Caminha, Portugal, September 9-15, 2000, Advanced Lectures
A relational account of call-by-value sequentiality
Information and Computation - Special issue: LICS'97
Games and Full Abstraction for FPC
LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
Slot games: a quantitative model of computation
Proceedings of the 32nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Information and Computation
Definability and Full Abstraction
Electronic Notes in Theoretical Computer Science (ENTCS)
Cryptographic logical relations
Theoretical Computer Science
Information and Computation
A fully abstract bidomain model of unary FPC
TLCA'03 Proceedings of the 6th international conference on Typed lambda calculi and applications
Universality results for models in locally boolean domains
CSL'06 Proceedings of the 20th international conference on Computer Science Logic
Program equivalence in a simple language with state
Computer Languages, Systems and Structures
Bi-models: Relational Versus Domain-theoretic Approaches
Fundamenta Informaticae
Remarks on semantic completeness for proof-terms with Laird's dual affine/intuitionistic λ-Calculus
Rewriting Computation and Proof
| Hi-index | 0.00 |