scientific article; zbMATH DE number 7559275
From MaRDI portal
Publication:5089009
DOI10.4230/LIPICS.FSCD.2019.9MaRDI QIDQ5089009FDOQ5089009
Authors: Frédéric Blanqui, Guillaume Genestier, Olivier Hermant 
Publication date: 18 July 2022
Full work available at URL: https://arxiv.org/abs/1906.11649
Title of this publication is not available (Why is that?)
Cites Work
- Embedding Pure Type Systems in the Lambda-Pi-Calculus Modulo
- A framework for defining logics
- Chain-complete posets and directed sets with applications
- Combinatory reduction systems: Introduction and survey
- Termination of term rewriting using dependency pairs
- The size-change principle for program termination
- Title not available (Why is that?)
- Title not available (Why is that?)
- Enhancing dependency pair method using strong computability in simply-typed term rewriting
- Logic for Programming, Artificial Intelligence, and Reasoning
- Tyrolean termination tool: techniques and features
- Mechanizing and improving dependency pairs
- Higher-order rewrite systems and their confluence
- Developing developments
- A general formulation of simultaneous inductive-recursive definitions in type theory
- The size-change principle and dependency pairs for termination of term rewriting
- Definitions by rewriting in the Calculus of Constructions
- Rewriting Techniques and Applications
- Termination of rewrite relations on \(\lambda\)-terms based on Girard's notion of reducibility
- Programming Languages and Systems
- Size-based termination of higher-order rewriting
- The Size-Change Termination Principle for Constructor Based Languages
- Calculating sized types
- Refinement Types as Higher-Order Dependency Pairs
- Title not available (Why is that?)
Cited In (5)
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5089009)
