Foundational aspects of syntax

Authors:
Dale Miller;Catuscia Palmidessi
Affiliations:
Department of Computer Science and Engineering, The Pennsylvania State University, 220 Pond Laboratory, University Park, PA;Department of Computer Science and Engineering, The Pennsylvania State University, 220 Pond Laboratory, University Park, PA
Venue:
ACM Computing Surveys (CSUR)
Year:
1999

Higher-order abstract syntax

PLDI '88 Proceedings of the ACM SIGPLAN 1988 conference on Programming Language design and Implementation
Elf: a language for logic definition and verified metaprogramming

Proceedings of the Fourth Annual Symposium on Logic in computer science
A framework for defining logics

Journal of the ACM (JACM)
Structured operational semantics and bisimulation as a congruence

Information and Computation
A calculus of mobile processes, II

Information and Computation
&pgr;-calculus, internal mobility, and agent-passing calculi

TAPSOFT '95 Selected papers from the 6th international joint conference on Theory and practice of software development
A notation for lambda terms. A generalization of environment

Theoretical Computer Science
Linear Unification of Higher-Order Patterns

TAPSOFT '93 Proceedings of the International Joint Conference CAAP/FASE on Theory and Practice of Software Development
A Logic for Reasoning with Higher-Order Abstract Syntax

LICS '97 Proceedings of the 12th Annual IEEE Symposium on Logic in Computer Science
Reasoning in a logic with definitions and induction

Reasoning in a logic with definitions and induction

Encoding Generic Judgments

FST TCS '02 Proceedings of the 22nd Conference Kanpur on Foundations of Software Technology and Theoretical Computer Science
Translating specifications from nominal logic to CIC with the theory of contexts

Proceedings of the 3rd ACM SIGPLAN workshop on Mechanized reasoning about languages with variable binding
Model checking for π-calculus using proof search

CONCUR 2005 - Concurrency Theory
A Logic for Reasoning about Generic Judgments

Electronic Notes in Theoretical Computer Science (ENTCS)
On the Role of Names in Reasoning about λ-tree Syntax Specifications

Electronic Notes in Theoretical Computer Science (ENTCS)
Proof search specifications of bisimulation and modal logics for the π-calculus

ACM Transactions on Computational Logic (TOCL)
Modeling Fresh Names in the π-calculus Using Abstractions

Electronic Notes in Theoretical Computer Science (ENTCS)
A Proof Search Specification of the π-Calculus

Electronic Notes in Theoretical Computer Science (ENTCS)
A Congruence Format for Name-passing Calculi

Electronic Notes in Theoretical Computer Science (ENTCS)
Representing and reasoning with operational semantics

IJCAR'06 Proceedings of the Third international joint conference on Automated Reasoning

Hi-index	0.00