Böhm trees as higher-order recursion schemes
Data and Resources
Additional Info
| Field | Value |
|---|---|
| Source | Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2013) |
| Author | Clairambault, Pierre, Murawski, Andrzej |
| Maintainer | CCSD |
| Last Updated | May 5, 2026, 20:38 (UTC) |
| Created | May 5, 2026, 20:38 (UTC) |
| Identifier | hal-00966102 |
| Language | en |
| Rights | https://about.hal.science/hal-authorisation-v1/ |
| contributor | Laboratoire de l'Informatique du Parallélisme (LIP) ; École normale supérieure de Lyon (ENS de Lyon) ; Université de Lyon-Université de Lyon-Université Claude Bernard Lyon 1 (UCBL) ; Université de Lyon-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS) |
| coverage | Guwahati, India |
| creator | Clairambault, Pierre |
| date | 2013-12-12T00:00:00 |
| harvest_object_id | 2913236e-55a0-4aa3-a2ef-d30f35357e98 |
| harvest_source_id | 3374d638-d20b-4672-ba96-a23232d55657 |
| harvest_source_title | test moissonnage SELUNE |
| metadata_modified | 2025-10-13T00:00:00 |
| relation | info:eu-repo/semantics/altIdentifier/doi/10.4230/LIPIcs.FSTTCS.2013.91 |
| set_spec | type:COMM |