Fully abstract translations between functional languages
POPL '91 Proceedings of the 18th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Higher-order binding-time analysis
PEPM '93 Proceedings of the 1993 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation
Algebraic reasoning and completeness in typed languages
POPL '93 Proceedings of the 20th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Combinatory representation of mobile processes
POPL '94 Proceedings of the 21st ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Isolating side effects in sequential languages
POPL '95 Proceedings of the 22nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Total correctness by local improvement in program transformation
POPL '95 Proceedings of the 22nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Higher-order expression procedures
PEPM '95 Proceedings of the 1995 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation
Bananas in space: extending fold and unfold to exponential types
FPCA '95 Proceedings of the seventh international conference on Functional programming languages and computer architecture
Total correctness by local improvement in the transformation of functional programs
ACM Transactions on Programming Languages and Systems (TOPLAS)
Denotational semantics using an operationally-based term model
Proceedings of the 24th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
From SOS rules to proof principles: an operational metatheory for functional languages
Proceedings of the 24th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
YALE: yet another lambda evaluator based on interaction nets
ICFP '98 Proceedings of the third ACM SIGPLAN international conference on Functional programming
A non-deterministic call-by-need lambda calculus
ICFP '98 Proceedings of the third ACM SIGPLAN international conference on Functional programming
An operational semantics for parallel lazy evaluation
ICFP '00 Proceedings of the fifth ACM SIGPLAN international conference on Functional programming
A model for comparing the space usage of lazy evaluators
Proceedings of the 2nd ACM SIGPLAN international conference on Principles and practice of declarative programming
Reasoning with higher-order abstract syntax in a logical framework
ACM Transactions on Computational Logic (TOCL)
Distributed processes and location failures
Theoretical Computer Science
Towards a primitive higher order calculus of broadcasting systems
Proceedings of the 4th ACM SIGPLAN international conference on Principles and practice of declarative programming
Annals of Mathematics and Artificial Intelligence
Infinite Intersection and Union Types for the Lazy Lambda Calculus
TACS '01 Proceedings of the 4th International Symposium on Theoretical Aspects of Computer Software
Mechanized Operational Semantics via (Co)Induction
TPHOLs '99 Proceedings of the 12th International Conference on Theorem Proving in Higher Order Logics
Combining Higher Order Abstract Syntax with Tactical Theorem Proving and (Co)Induction
TPHOLs '02 Proceedings of the 15th International Conference on Theorem Proving in Higher Order Logics
HOPLA-A Higher-Order Process Language
CONCUR '02 Proceedings of the 13th International Conference on Concurrency Theory
A Logic for Probabilities in Semantics
CSL '02 Proceedings of the 16th International Workshop and 11th Annual Conference of the EACSL on Computer Science Logic
Operational equivalence for interaction nets
Theoretical Computer Science - Latin American theoretical informatics
On the computational complexity of bisimulation, redux
PCK50 Proceedings of the Paris C. Kanellakis memorial workshop on Principles of computing & knowledge: Paris C. Kanellakis memorial workshop on the occasion of his 50th birthday
Linear Logic, Monads and the Lambda Calculus
LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
LICS '00 Proceedings of the 15th Annual IEEE Symposium on Logic in Computer Science
A semantic theory for value-passing processes based on the late approach
Information and Computation
Information and Computation - TACS 2001
A bisimulation for dynamic sealing
Proceedings of the 31st ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Final coalgebras as greatest fixed points in ZF set theory
Mathematical Structures in Computer Science
Coinductive characterizations of applicative structures
Mathematical Structures in Computer Science
A semantics for lambda calculi with resources
Mathematical Structures in Computer Science
On the bisimulation proof method
Mathematical Structures in Computer Science
Mathematical Structures in Computer Science
Action semantics reasoning about functional programs
Mathematical Structures in Computer Science
Program equivalence in a linear functional language
Journal of Functional Programming
The call-by-need lambda calculus
Journal of Functional Programming
Theoretical Computer Science - Logic, semantics and theory of programming
A bisimulation for type abstraction and recursion
Proceedings of the 32nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
On the computational complexity of bisimulation, redux
Information and Computation - Special issue: Commemorating the 50th birthday anniversary of Paris C. Kanellakis
On the representation of McCarthy's amb in the π-calculus
Theoretical Computer Science - Expressiveness in concurrency
Small bisimulations for reasoning about higher-order imperative programs
Conference record of the 33rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A structural approach to reversible computation
Theoretical Computer Science
Call-by-push-value: Decomposing call-by-value and call-by-name
Higher-Order and Symbolic Computation
A complete, co-inductive syntactic theory of sequential control and state
Proceedings of the 34th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Infinite Unfolding and Transformations of Nondeterministic Programs
Fundamenta Informaticae - Program Transformation: Theoretical Foundations and Basic Techniques. Part 1
Amb Breaks Well-Pointedness, Ground Amb Doesn't
Electronic Notes in Theoretical Computer Science (ENTCS)
SOS formats and meta-theory: 20 years after
Theoretical Computer Science
A bisimulation for dynamic sealing
Theoretical Computer Science
On Well-Foundedness and Expressiveness of Promoted Tyft
Electronic Notes in Theoretical Computer Science (ENTCS)
Relational semantics for effect-based program transformations with dynamic allocation
Proceedings of the 9th ACM SIGPLAN international conference on Principles and practice of declarative programming
A bisimulation for type abstraction and recursion
Journal of the ACM (JACM)
Explaining the lazy Krivine machine using explicit substitution and addresses
Higher-Order and Symbolic Computation
RTA '08 Proceedings of the 19th international conference on Rewriting Techniques and Applications
Information Systems
Operational domain theory and topology of sequential programming languages
Information and Computation
Exploratory Functions on Nondeterministic Strategies, up to Lower Bisimilarity
Electronic Notes in Theoretical Computer Science (ENTCS)
Logical Semantics for Stability
Electronic Notes in Theoretical Computer Science (ENTCS)
A Logical Interpretation of the λ-Calculus into the η-Calculus, Preserving Spine Reduction and Types
CONCUR 2009 Proceedings of the 20th International Conference on Concurrency Theory
Congruence of Bisimulation in a Non-Deterministic Call-By-Need Lambda Calculus
Electronic Notes in Theoretical Computer Science (ENTCS)
Normal Form Simulation for McCarthy's Amb
Electronic Notes in Theoretical Computer Science (ENTCS)
On the Observational Theory of the CPS-calculus
Electronic Notes in Theoretical Computer Science (ENTCS)
On the computational complexity of bisimulation, redux
Information and Computation
Closures of may-, should- and must-convergences for contextual equivalence
Information Processing Letters
Similarity implies equivalence in a class of non-deterministic call-by-need lambda calculi
Information and Computation
On the expressiveness of interaction
Theoretical Computer Science
TLCA'01 Proceedings of the 5th international conference on Typed lambda calculi and applications
A fully abstract bidomain model of unary FPC
TLCA'03 Proceedings of the 6th international conference on Typed lambda calculi and applications
Parametric (co)iteration vs. primitive direcursion
CALCO'07 Proceedings of the 2nd international conference on Algebra and coalgebra in computer science
Logical bisimulations and functional languages
FSEN'07 Proceedings of the 2007 international conference on Fundamentals of software engineering
Correctness of copy in calculi with letrec
RTA'07 Proceedings of the 18th international conference on Term rewriting and applications
A complete, co-inductive syntactic theory of sequential control and state
Semantics and algebraic specification
Environmental bisimulations for higher-order languages
ACM Transactions on Programming Languages and Systems (TOPLAS)
Strong normalization from an unusual point of view
Theoretical Computer Science
Relating function spaces to resourced function spaces
Proceedings of the 2011 ACM Symposium on Applied Computing
Information Processing Letters
A contextual semantics for concurrent Haskell with futures
Proceedings of the 13th international ACM SIGPLAN symposium on Principles and practices of declarative programming
From Applicative to Environmental Bisimulation
Electronic Notes in Theoretical Computer Science (ENTCS)
The marriage of bisimulations and Kripke logical relations
POPL '12 Proceedings of the 39th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
SCC: a service centered calculus
WS-FM'06 Proceedings of the Third international conference on Web Services and Formal Methods
Bisimulations for untyped imperative objects
ESOP'06 Proceedings of the 15th European conference on Programming Languages and Systems
Program equivalence in a simple language with state
Computer Languages, Systems and Structures
Reasoning about multi-stage programs
ESOP'12 Proceedings of the 21st European conference on Programming Languages and Systems
Proving the correctness of unfold/fold program transformations using bisimulation
PSI'11 Proceedings of the 8th international conference on Perspectives of System Informatics
Property-preserving program refinement
Proceedings of the 27th IEEE/ACM International Conference on Automated Software Engineering
Conservative Concurrency in Haskell
LICS '12 Proceedings of the 2012 27th Annual IEEE/ACM Symposium on Logic in Computer Science
Solution to the Range Problem for Combinatory Logic
Fundamenta Informaticae
Operational semantics using the partiality monad
Proceedings of the 17th ACM SIGPLAN international conference on Functional programming
Infinite Unfolding and Transformations of Nondeterministic Programs
Fundamenta Informaticae - Program Transformation: Theoretical Foundations and Basic Techniques. Part 1
Coinductive Axiomatization of Recursive Type Equality and Subtyping
Fundamenta Informaticae
Names, Equations, Relations: Practical Ways to Reason about new
Fundamenta Informaticae
Electronic Notes in Theoretical Computer Science (ENTCS)
Typed normal form bisimulation
CSL'07/EACSL'07 Proceedings of the 21st international conference, and Proceedings of the 16th annuall conference on Computer Science Logic
DEXA'07 Proceedings of the 18th international conference on Database and Expert Systems Applications
An output-based semantics of Λμ with explicit substitution in the π-calculus: extended abstract
TCS'12 Proceedings of the 7th IFIP TC 1/WG 202 international conference on Theoretical Computer Science
On coinductive equivalences for higher-order probabilistic functional programs
Proceedings of the 41st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages
| Hi-index | 0.01 |