Abstract
The rho-calculi provide enlightening concepts for both computing and reasoning as well as their combination. They consist in the generalization of lambda-calculus to structures like terms,
propositions or graphs and we will show how their interrelations with deduction provide powerful frameworks for the next generation of proof assistants.
BibTeX - Entry
@InProceedings{kirchner:LIPIcs:2012:3479,
author = {Claude Kirchner},
title = {{Rho-Calculi for Computation and Logic (Invited Talk)}},
booktitle = {23rd International Conference on Rewriting Techniques and Applications (RTA'12) },
pages = {2--4},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-38-5},
ISSN = {1868-8969},
year = {2012},
volume = {15},
editor = {Ashish Tiwari},
publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
address = {Dagstuhl, Germany},
URL = {http://drops.dagstuhl.de/opus/volltexte/2012/3479},
URN = {urn:nbn:de:0030-drops-34796},
doi = {10.4230/LIPIcs.RTA.2012.2},
annote = {Keywords: rewriting calculus, rho-calculus, deduction modulo}
}
Keywords: |
|
rewriting calculus, rho-calculus, deduction modulo |
Collection: |
|
23rd International Conference on Rewriting Techniques and Applications (RTA'12) |
Issue Date: |
|
2012 |
Date of publication: |
|
29.05.2012 |