The Formalization of Syntax-Based Mathematical Algorithms Using Quotation and Evaluation

DOI10.1007/978-3-642-39320-4_3zbMath1390.68778arXiv1305.6052OpenAlexW2108445687MaRDI QIDQ2843004

William M. Farmer

Publication date: 9 August 2013

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1305.6052

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Knowledge representation (68T30)

Related Items (6)

Theory morphisms in Church's type theory with quotation and evaluation ⋮ Formalizing mathematical knowledge as a biform theory graph: a case study ⋮ Automatically proving equivalence by type-safe reflection ⋮ Generic Literals ⋮ Incorporating quotation and evaluation into Church's type theory ⋮ Incorporating Quotation and Evaluation into Church’s Type Theory: Syntax and Semantics

This page was built for publication: The Formalization of Syntax-Based Mathematical Algorithms Using Quotation and Evaluation