This repository explores type-directed partial evaluation of various lambda-calculi equipped with rich reduction relations. The development axis involve: baking soundness directly in the model definition, separating normalization and standardization or performing only weak-head normalization.
The repository is organized in this way:
Generic tools to formalize calculi and their reduction rules. Currently contains a formalization of transitive reflexive (symmetric) closures and (non dependent) contexts.
Simply typed lambda calculus: always a good start when trying out new ideas.
Simply typed lambda calculus with lists, products and a unit type and a reduction relation having special rules to deal with map, fold, append and their fusion.
Simply typed lambda calculus with a universe of finitely branching inductive skeleton and their eliminators / recursors.
This repository will host only (quite) stable formalizations. The ongoing developments happen at patch-tag:
All the .agda files in the repository agda-nbe are licensed under GPLv3.
agda-nbe is a formalization of nbe for different lambda calculi Copyright (C) 2012 allais guillaume email@example.com
This program is free software: you can redistribute it and/or modify it under the terms of the GNU General Public License as published by the Free Software Foundation, either version 3 of the License, or (at your option) any later version.
This program is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details.
You should have received a copy of the GNU General Public License along with this program. If not, see http://www.gnu.org/licenses/.