A fresh approach to representing syntax with static binders in functional programming
Proceedings of the sixth ACM SIGPLAN international conference on Functional programming
Macros as multi-stage computations: type-safe, generative, binding macros in MacroML
Proceedings of the sixth ACM SIGPLAN international conference on Functional programming
Meta-programming with names and necessity
Proceedings of the seventh ACM SIGPLAN international conference on Functional programming
POPL '03 Proceedings of the 30th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A Type-Theoretic Approach to Induction with Higher-Order Encodings
LPAR '01 Proceedings of the Artificial Intelligence on Logic for Programming
Nominal Logic: A First Order Theory of Names and Binding
TACS '01 Proceedings of the 4th International Symposium on Theoretical Aspects of Computer Software
An Axiomatic Approach to Metareasoning on Nominal Algebras in HOAS
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
Equivariant Syntax and Semantics
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Recursion for Higher-Order Encodings
CSL '01 Proceedings of the 15th International Workshop on Computer Science Logic
Fine Control of Demand in Haskell
MPC '02 Proceedings of the 6th International Conference on Mathematics of Program Construction
A Logic Programming Language Based on Binding Algebras
TACS '01 Proceedings of the 4th International Symposium on Theoretical Aspects of Computer Software
Term rewriting with variable binding: an initial algebra approach
Proceedings of the 5th ACM SIGPLAN international conference on Principles and practice of declaritive programming
From dynamic binding to state via modal possibility
Proceedings of the 5th ACM SIGPLAN international conference on Principles and practice of declaritive programming
Boxes go bananas: encoding higher-order abstract syntax with parametric polymorphism
ICFP '03 Proceedings of the eighth ACM SIGPLAN international conference on Functional programming
FreshML: programming with binders made simple
ICFP '03 Proceedings of the eighth ACM SIGPLAN international conference on Functional programming
Meta-programming through typeful code representation
ICFP '03 Proceedings of the eighth ACM SIGPLAN international conference on Functional programming
Nominal logic, a first order theory of names and binding
Information and Computation - TACS 2001
A type system for well-founded recursion
Proceedings of the 31st ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Compiler implementation in a formal logical framework
MERLIN '03 Proceedings of the 2003 ACM SIGPLAN workshop on Mechanized reasoning about languages with variable binding
A model-checking verification environment for mobile processes
ACM Transactions on Software Engineering and Methodology (TOSEM)
PPDP '04 Proceedings of the 6th ACM SIGPLAN international conference on Principles and practice of declarative programming
Nominal rewriting with name generation: abstraction vs. locality
PPDP '05 Proceedings of the 7th ACM SIGPLAN international conference on Principles and practice of declarative programming
Scrap your nameplate: (functional pearl)
Proceedings of the tenth ACM SIGPLAN international conference on Functional programming
Combining higher-order abstract syntax with first-order abstract syntax in ATS
Proceedings of the 3rd ACM SIGPLAN workshop on Mechanized reasoning about languages with variable binding
Meta-programming through typeful code representation
Journal of Functional Programming
Staged computation with names and necessity
Journal of Functional Programming
ACM SIGACT News
Formal compiler construction in a logical framework
Higher-Order and Symbolic Computation
An initial algebra approach to term rewriting systems with variable binders
Higher-Order and Symbolic Computation
Mechanized meta-reasoning using a hybrid HOAS/de bruijn representation and reflection
Proceedings of the eleventh ACM SIGPLAN international conference on Functional programming
Proceedings of the 34th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Coalgebraic minimization of HD-automata for the π-calculus using polymorphic types
Theoretical Computer Science - Formal methods for components and objects
Program Transformation with Scoped Dynamic Rewrite Rules
Fundamenta Informaticae - Program Transformation: Theoretical Foundations and Basic Techniques. Part 2
Manipulating Trees with Hidden Labels
Electronic Notes in Theoretical Computer Science (ENTCS)
Electronic Notes in Theoretical Computer Science (ENTCS)
Boxes go bananas: Encoding higher-order abstract syntax with parametric polymorphism*
Journal of Functional Programming
ACM Transactions on Programming Languages and Systems (TOPLAS)
A polynomial nominal unification algorithm
Theoretical Computer Science
Electronic Notes in Theoretical Computer Science (ENTCS)
A study of substitution, using nominal techniques and Fraenkel-Mostowksi sets
Theoretical Computer Science
A universe of binding and computation
Proceedings of the 14th ACM SIGPLAN international conference on Functional programming
Relating state-based and process-based concurrency through linear logic (full-version)
Information and Computation
The lambda-context calculus (extended version)
Information and Computation
Electronic Notes in Theoretical Computer Science (ENTCS)
Fresh O'Caml: Nominal Abstract Syntax for the Masses
Electronic Notes in Theoretical Computer Science (ENTCS)
A survey of strategies in rule-based program transformation systems
Journal of Symbolic Computation
Manipulating trees with hidden labels
FOSSACS'03/ETAPS'03 Proceedings of the 6th International conference on Foundations of Software Science and Computation Structures and joint European conference on Theory and practice of software
A monadic multi-stage metalanguage
FOSSACS'03/ETAPS'03 Proceedings of the 6th International conference on Foundations of Software Science and Computation Structures and joint European conference on Theory and practice of software
Matching and alpha-equivalence check for nominal terms
Journal of Computer and System Sciences
Freshness and name-restriction in sets of traces with names
FOSSACS'11/ETAPS'11 Proceedings of the 14th international conference on Foundations of software science and computational structures: part of the joint European conferences on theory and practice of software
Program generation and components
FMCO'04 Proceedings of the Third international conference on Formal Methods for Components and Objects
Program Transformation with Scoped Dynamic Rewrite Rules
Fundamenta Informaticae - Program Transformation: Theoretical Foundations and Basic Techniques. Part 2
Full abstraction for nominal Scott domains
POPL '13 Proceedings of the 40th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
| Hi-index | 0.00 |