The meaning of negative premises in transition system specifications
Journal of the ACM (JACM)
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
Extensionality and intensionality of the ambient logics
POPL '01 Proceedings of the 28th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Stack inspection: theory and variants
POPL '02 Proceedings of the 29th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Reasoning with higher-order abstract syntax in a logical framework
ACM Transactions on Computational Logic (TOCL)
Information and Computation
Towards a primitive higher order calculus of broadcasting systems
Proceedings of the 4th ACM SIGPLAN international conference on Principles and practice of declarative programming
Stack inspection: Theory and variants
ACM Transactions on Programming Languages and Systems (TOPLAS)
Unique Fixed Point Induction for McCarthy's Amb
MFCS '99 Proceedings of the 24th International Symposium on Mathematical Foundations of Computer Science
HOPLA-A Higher-Order Process Language
CONCUR '02 Proceedings of the 13th International Conference on Concurrency Theory
A pi-calculus Process Semantics of Concurrent Idealised ALGOL
FoSSaCS '99 Proceedings of the Second International Conference on Foundations of Software Science and Computation Structure, Held as Part of the European Joint Conferences on the Theory and Practice of Software, ETAPS'99
Applied Semantics, International Summer School, APPSEM 2000, Caminha, Portugal, September 9-15, 2000, Advanced Lectures
Operational equivalence for interaction nets
Theoretical Computer Science - Latin American theoretical informatics
Reasoning about local variables with operationally-based logical relations
LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
A bisimulation for dynamic sealing
Proceedings of the 31st ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A format for semantic equivalence comparison
Theoretical Computer Science
Coinductive characterizations of applicative structures
Mathematical Structures in Computer Science
Program equivalence in a linear functional language
Journal of Functional Programming
Compilation and equivalence of imperative objects
Journal of Functional Programming
A bisimulation for type abstraction and recursion
Proceedings of the 32nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Bisimilarity for the Region Calculus
Higher-Order and Symbolic Computation
On the representation of McCarthy's amb in the π-calculus
Theoretical Computer Science - Expressiveness in concurrency
SOS for higher order processes
CONCUR 2005 - Concurrency Theory
Behavioral theory for mobile ambients
Journal of the ACM (JACM)
Proceedings of the 34th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Proceedings of the 6th international conference on Aspect-oriented software development
Amb Breaks Well-Pointedness, Ground Amb Doesn't
Electronic Notes in Theoretical Computer Science (ENTCS)
Syntactic Logical Relations for Polymorphic and Recursive Types
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)
A bisimulation for type abstraction and recursion
Journal of the ACM (JACM)
RTA '08 Proceedings of the 19th international conference on Rewriting Techniques and Applications
Normal Bisimulations in Calculi with Passivation
FOSSACS '09 Proceedings of the 12th International Conference on Foundations of Software Science and Computational Structures: Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009
Transactions on Aspect-Oriented Software Development V
Exploratory Functions on Nondeterministic Strategies, up to Lower Bisimilarity
Electronic Notes in Theoretical Computer Science (ENTCS)
Howe's Method for Calculi with Passivation
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)
An Operational Domain-theoretic Treatment of Recursive Types
Electronic Notes in Theoretical Computer Science (ENTCS)
On the Observational Theory of the CPS-calculus
Electronic Notes in Theoretical Computer Science (ENTCS)
A Hierarchy of SOS Rule Formats
Electronic Notes in Theoretical Computer Science (ENTCS)
A Congruence Format for Name-passing Calculi
Electronic Notes in Theoretical Computer Science (ENTCS)
Similarity implies equivalence in a class of non-deterministic call-by-need lambda calculi
Information and Computation
On generic context lemmas for higher-order calculi with sharing
Theoretical Computer Science
Diagrams for meaning preservation
RTA'03 Proceedings of the 14th international conference on Rewriting techniques and applications
Logical bisimulations and functional languages
FSEN'07 Proceedings of the 2007 international conference on Fundamentals of software engineering
Complete lattices and up-to techniques
APLAS'07 Proceedings of the 5th Asian conference on Programming languages and systems
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)
On the expressiveness and decidability of higher-order process calculi
Information and Computation
Characterizing contextual equivalence in calculi with passivation
Information and Computation
From Applicative to Environmental Bisimulation
Electronic Notes in Theoretical Computer Science (ENTCS)
Journal of Automated Reasoning
Distillation with labelled transition systems
PEPM '12 Proceedings of the ACM SIGPLAN 2012 workshop on Partial evaluation and program manipulation
Extending howe's method to early bisimulations for typed mobile embedded resources with local names
FSTTCS '05 Proceedings of the 25th international conference on Foundations of Software Technology and Theoretical Computer Science
Representing and reasoning with operational semantics
IJCAR'06 Proceedings of the Third international joint conference on Automated Reasoning
Reduction in a linear lambda-calculus with applications to operational semantics
RTA'05 Proceedings of the 16th international conference on Term Rewriting and Applications
Reasoning about multi-stage programs
ESOP'12 Proceedings of the 21st European conference on Programming Languages and Systems
Applicative bisimulations for delimited-control operators
FOSSACS'12 Proceedings of the 15th international conference on Foundations of Software Science and Computational Structures
Encoding Abstract Syntax Without Fresh Names
Journal of Automated Reasoning
Proving the correctness of unfold/fold program transformations using bisimulation
PSI'11 Proceedings of the 8th international conference on Perspectives of System Informatics
Conservative Concurrency in Haskell
LICS '12 Proceedings of the 2012 27th Annual IEEE/ACM Symposium on Logic in Computer Science
A supposedly fun thing i may have to do again: a HOAS encoding of Howe's method
Proceedings of the seventh international workshop on Logical frameworks and meta-languages, theory and practice
Names, Equations, Relations: Practical Ways to Reason about new
Fundamenta Informaticae
A Two-Valued Logic for Properties of Strict Functional Programs Allowing Partial Functions
Journal of Automated Reasoning
Formal program optimization in nuprl using computational equivalence and partial types
ITP'13 Proceedings of the 4th international conference on Interactive Theorem Proving
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.00 |