- 【Updated on May 12, 2025】 Integration of CiNii Dissertations and CiNii Books into CiNii Research
- Trial version of CiNii Research Knowledge Graph Search feature is available on CiNii Labs
- Suspension and deletion of data provided by Nikkei BP
- Regarding the recording of “Research Data” and “Evidence Data”
Explicit substitutions and higher-order syntax
Search this article
Description
Recently there has been a great deal of interest in higher-order syntax which seeks to extend standard initial algebra semantics to cover languages with variable binding. The canonical example studied in the literature is that of the untyped ?-calculus which is handled as an instance of the general theory of binding algebras, cf. Fiore et al. [13]. Another important syntactic construction is that of explicit substitutions which are used to model local definitions and to implement reduction in the ?-calculus. The syntax of a language with explicit substitutions does not form a binding algebra as an explicit substitution may bind an arbitrary number of variables. Thus explicit substitutions are a natural test case for the further development of the theory and applications of syntax with variable binding. This paper shows that a language containing explicit substitutions and a first-order signature ? is naturally modelled as the initial algebra of the Id + F ??_ +_ ? _ endofunctor. We derive a similar formula for adding explicit substitutions to the untyped ?-calculus and then show these initial algebras provide useful datatypes for manipulating abstract syntax by implementing two reduction machines. We also comment on the apparent lack of modularity in syntax with variable binding as compared to first-order languages.
Journal
-
- Higher-Order and Symbolic Computation
-
Higher-Order and Symbolic Computation 19 263-282, 2006-09-01
Springer Science and Business Media LLC
- Tweet
Details 詳細情報について
-
- CRID
- 1871991017476422912
-
- ISSN
- 15730557
- 13883690
-
- Data Source
-
- OpenAIRE