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
Semantic analysis of normalisation by evaluation for typed lambda calculus
Proceedings of the 4th ACM SIGPLAN international conference on Principles and practice of declarative programming
Composing monads using coproducts
Proceedings of the seventh ACM SIGPLAN international conference on Functional programming
Binding Logic: Proofs and Models
LPAR '02 Proceedings of the 9th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning
Abstract Syntax and Variable Binding for Linear Binders
MFCS '00 Proceedings of the 25th International Symposium on Mathematical Foundations of Computer Science
A Simply Typed Context Calculus with First-Class Environments
FLOPS '01 Proceedings of the 5th International Symposium on Functional and Logic Programming
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
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
A Kripke-Style Model for the Admissibility of Structural Rules
TYPES '00 Selected papers from the International Workshop on Types for Proofs and Programs
FroCoS '02 Proceedings of the 4th International Workshop on Frontiers of Combining Systems
FST TCS '02 Proceedings of the 22nd Conference Kanpur on Foundations of Software Technology and Theoretical Computer Science
A Formalised First-Order Confluence Proof for the lambda-Calculus Using One-Sorted Variable Names
RTA '01 Proceedings of the 12th International Conference on Rewriting Techniques and Applications
Abstract Syntax for Variable Binders: An Overview
CL '00 Proceedings of the First International Conference on Computational Logic
Monadic Presentations of Lambda Terms Using Generalized Inductive Types
CSL '99 Proceedings of the 13th International Workshop and 8th Annual Conference of the EACSL on Computer Science Logic
CSL '02 Proceedings of the 16th International Workshop and 11th Annual Conference of the EACSL on Computer Science Logic
Theory of Judgments and Derivations
Progress in Discovery Science, Final Report of the Japanese Discovery Science Project
A Logic Programming Language Based on Binding Algebras
TACS '01 Proceedings of the 4th International Symposium on Theoretical Aspects of Computer Software
A framework for studying substitution
Acta Cybernetica
Models for Name-Passing Processes: Interleaving and Causal
LICS '00 Proceedings of the 15th Annual IEEE Symposium on Logic in Computer Science
A formalised first-order confluence proof for the λ-calculus using one-sorted variable names
Information and Computation - RTA 2001
Term rewriting with variable binding: an initial algebra approach
Proceedings of the 5th ACM SIGPLAN international conference on Principles and practice of declaritive programming
A framework for typed HOAS and semantics
Proceedings of the 5th ACM SIGPLAN international conference on Principles and practice of declaritive programming
Nominal logic, a first order theory of names and binding
Information and Computation - TACS 2001
Mathematical Structures in Computer Science
TinkerType: a language for playing with formal systems
Journal of Functional Programming
A definitional approach to primitivexs recursion over higher order abstract syntax
MERLIN '03 Proceedings of the 2003 ACM SIGPLAN workshop on Mechanized reasoning about languages with variable binding
Reasoning on an imperative object-based calculus in Higher Order Abstract Syntax
MERLIN '03 Proceedings of the 2003 ACM SIGPLAN workshop on Mechanized reasoning about languages with variable binding
A unified category theoretic approach to variable binding
MERLIN '03 Proceedings of the 2003 ACM SIGPLAN workshop on Mechanized reasoning about languages with variable binding
Explicit substitutions and higher-order syntax
MERLIN '03 Proceedings of the 2003 ACM SIGPLAN workshop on Mechanized reasoning about languages with variable binding
Confluence of the coinductive λ-calculus
Theoretical Computer Science
Nordic Journal of Computing
A model-checking verification environment for mobile processes
ACM Transactions on Software Engineering and Methodology (TOSEM)
Models for name-passing processes: interleaving and causal
Information and Computation
Theoretical Computer Science
Category theory for operational semantics
Theoretical Computer Science - Selected papers of CMCS'03
Substitution in non-wellfounded syntax with variable binding
Theoretical Computer Science - Selected papers of CMCS'03
Monads of coalgebras: rational terms and term graphs
Mathematical Structures in Computer Science
A computational approach to reflective meta-reasoning about languages with bindings
Proceedings of the 3rd ACM SIGPLAN workshop on Mechanized reasoning about languages with variable binding
A unified category-theoretic formulation of typed binding signatures
Proceedings of the 3rd ACM SIGPLAN workshop on Mechanized reasoning about languages with variable binding
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
Staged computation with names and necessity
Journal of Functional Programming
ACM SIGACT News
Consistency of the theory of contexts
Journal of Functional Programming
Alpha-structural recursion and induction
Journal of the ACM (JACM)
Pseudo-distributive laws and axiomatics for variable binding
Higher-Order and Symbolic Computation
An initial algebra approach to term rewriting systems with variable binders
Higher-Order and Symbolic Computation
Explicit substitutions and higher-order syntax
Higher-Order and Symbolic Computation
Structured coalgebras and minimal HD-automata for the π-calculus
Theoretical Computer Science - Mathematical foundations of computer science 2000
∂ for Data: Differentiating Data Structures
Fundamenta Informaticae - Typed Lambda Calculi and Applications 2003, Selected Papers
Abstract Syntax: Substitution and Binders
Electronic Notes in Theoretical Computer Science (ENTCS)
Electronic Notes in Theoretical Computer Science (ENTCS)
Bialgebraic Methods in Structural Operational Semantics
Electronic Notes in Theoretical Computer Science (ENTCS)
Reasoning about Object-based Calculi in (Co)Inductive Type Theory and the Theory of Contexts
Journal of Automated Reasoning
Higher-order semantic labelling for inductive datatype systems
Proceedings of the 9th ACM SIGPLAN international conference on Principles and practice of declarative programming
Free-algebra models for the π -calculus
Theoretical Computer Science
A Name Abstraction Functor for Named Sets
Electronic Notes in Theoretical Computer Science (ENTCS)
Functorial Coalgebraic Logic: The Case of Many-sorted Varieties
Electronic Notes in Theoretical Computer Science (ENTCS)
ACM Transactions on Programming Languages and Systems (TOPLAS)
Category Theoretic Semantics for Typed Binding Signatures with Recursion
Fundamenta Informaticae - Logic for Pragmatics
A Category of Explicit Fusions
Concurrency, Graphs and Models
MPC '08 Proceedings of the 9th international conference on Mathematics of Program Construction
A Categorical Model of the Fusion Calculus
Electronic Notes in Theoretical Computer Science (ENTCS)
LPAR '08 Proceedings of the 15th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning
Electronic Notes in Theoretical Computer Science (ENTCS)
A study of substitution, using nominal techniques and Fraenkel-Mostowksi sets
Theoretical Computer Science
A congruence rule format for name-passing process calculi
Information and Computation
Bialgebraic methods and modal logic in structural operational semantics
Information and Computation
On the construction of free algebras for equational systems
Theoretical Computer Science
Initial Algebra Semantics for Cyclic Sharing Structures
TLCA '09 Proceedings of the 9th International Conference on Typed Lambda Calculi and Applications
Theory support for weak higher order abstract syntax in Isabelle/HOL
Proceedings of the Fourth International Workshop on Logical Frameworks and Meta-Languages: Theory and Practice
Elgot Theories: A New Perspective of Iteration Theories (Extended Abstract)
Electronic Notes in Theoretical Computer Science (ENTCS)
A universe of binding and computation
Proceedings of the 14th ACM SIGPLAN international conference on Functional programming
Variable Binding, Symmetric Monoidal Closed Theories, and Bigraphs
CONCUR 2009 Proceedings of the 20th International Conference on Concurrency Theory
Relationally Staged Computations in Calculi of Mobile Processes
Electronic Notes in Theoretical Computer Science (ENTCS)
A Proof Search Specification of the π-Calculus
Electronic Notes in Theoretical Computer Science (ENTCS)
Proceedings of the 37th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A Congruence Format for Name-passing Calculi
Electronic Notes in Theoretical Computer Science (ENTCS)
A principled approach to programming with nested types in Haskell
Higher-Order and Symbolic Computation
Modules over monads and initial semantics
Information and Computation
External and internal syntax of the λ-calculus
Journal of Symbolic Computation
Normalization by evaluation for the computational lambda-calculus
TLCA'01 Proceedings of the 5th international conference on Typed lambda calculi and applications
A universal embedding for the higher order structure of computational effects
TLCA'03 Proceedings of the 6th international conference on Typed lambda calculi and applications
Modules over monads and linearity
WoLLIC'07 Proceedings of the 14th international conference on Logic, language, information and computation
Initial algebra semantics is enough!
TLCA'07 Proceedings of the 8th international conference on Typed lambda calculi and applications
On the relation between sized-types based termination and semantic labelling
CSL'09/EACSL'09 Proceedings of the 23rd CSL international conference and 18th EACSL Annual conference on Computer science logic
Semantics of higher-order recursion schemes
CALCO'09 Proceedings of the 3rd international conference on Algebra and coalgebra in computer science
On universal algebra over nominal sets
Mathematical Structures in Computer Science
Iterative reflections of monads
Mathematical Structures in Computer Science
Binding in Nominal Equational Logic
Electronic Notes in Theoretical Computer Science (ENTCS)
Equational properties of iterative monads
Information and Computation
Symmetries, local names and dynamic (de)-allocation of names
Information and Computation
Presenting functors on many-sorted varieties and applications
Information and Computation
Second-order algebraic theories
MFCS'10 Proceedings of the 35th international conference on Mathematical foundations of computer science
CSL'10/EACSL'10 Proceedings of the 24th international conference/19th annual conference on Computer science logic
Elgot theories: A new perspective on the equational properties of iteration
Mathematical Structures in Computer Science
Polymorphic abstract syntax via Grothendieck construction
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
Recursion principles for syntax with bindings and substitution
Proceedings of the 16th ACM SIGPLAN international conference on Functional programming
A foundation for GADTs and inductive families: dependent polynomial functor approach
Proceedings of the seventh ACM SIGPLAN workshop on Generic programming
2-Dimensional Directed Type Theory
Electronic Notes in Theoretical Computer Science (ENTCS)
Alpha-structural recursion and induction
TPHOLs'05 Proceedings of the 18th international conference on Theorem Proving in Higher Order Logics
Model checking for nominal calculi
FOSSACS'05 Proceedings of the 8th international conference on Foundations of Software Science and Computation Structures
Mathematical models of computational and combinatorial structures
FOSSACS'05 Proceedings of the 8th international conference on Foundations of Software Science and Computation Structures
Free-algebra models for the π-calculus
FOSSACS'05 Proceedings of the 8th international conference on Foundations of Software Science and Computation Structures
A unifying model of variables and names
FOSSACS'05 Proceedings of the 8th international conference on Foundations of Software Science and Computation Structures
Binding signatures for generic contexts
TLCA'05 Proceedings of the 7th international conference on Typed Lambda Calculi and Applications
Universal algebra for termination of higher-order rewriting
RTA'05 Proceedings of the 16th international conference on Term Rewriting and Applications
Relational semantics for higher-order programs
MPC'06 Proceedings of the 8th international conference on Mathematics of Program Construction
Semantic labelling for proving termination of combinatory reduction systems
WFLP'09 Proceedings of the 18th international conference on Functional and Constraint Logic Programming
Monads need not be endofunctors
FOSSACS'10 Proceedings of the 13th international conference on Foundations of Software Science and Computational Structures
Theoretical Computer Science
A Presheaf Environment for the Explicit Fusion Calculus
Journal of Automated Reasoning
Discrete generalised polynomial functors
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part II
Category Theoretic Semantics for Typed Binding Signatures with Recursion
Fundamenta Informaticae - Logic for Pragmatics
∂ for Data: Differentiating Data Structures
Fundamenta Informaticae - Typed Lambda Calculi and Applications 2003, Selected Papers
Equational systems and free constructions
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
An algebraic presentation of predicate logic
FOSSACS'13 Proceedings of the 16th international conference on Foundations of Software Science and Computation Structures
Multiversal Polymorphic Algebraic Theories: Syntax, Semantics, Translations, and Equational Logic
LICS '13 Proceedings of the 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science
| Hi-index | 0.01 |
We develop a theory of abstract syntax with variable binding. To every binding signature we associate a category of models consisting of variable sets endowed with compatible algebra and substitution structures. The syntax generated by the signature is the initial model. This gives a notion of initial algebra semantics encompassing the traditional one; besides compositionality, it automatically verifies the semantic substitution lemma.