-
Course code, if applicable: CSCI3393.01 and MATH4311.01 (cross-listed)
University hosting the course: Boston College
Contact person: Carl McTague, carl.mctague@bc.edu
Concepts taught: Automated Rea…
-
Course code, if applicable:
University hosting the course: University of Zagreb
Contact person: Vedran Čačić, veky@math.hr
Concepts taught: Automated Reasoning,Axiomatic Semantics ,Data Structures…
-
https://dl.acm.org/doi/10.1145/3434304
equality saturation
term -> term
-
![image](https://github.com/user-attachments/assets/2eea85e2-939e-4d53-83f6-358c4a3c5655)
-
Reported by **till** and assigned to **till**
Migrated from http://trac.informatik.uni-bremen.de:8080/hets/ticket/645
---
According to the paper Klaus Lüttich and Till Mossakowski. Reasoning Suppor…
-
(if they still exist).
-
Equality `=` is translated by Isabelle into Haskell as a new function definition `equal_T` (with `T` the type). HipSpec gets an additional function, obtaining corresponding properties. When brought ba…
-
The ability to run Coq and MetaCoq, powerful proof systems, inside a large language model (LLM) like me is indeed significant. This opens up a range of exciting possibilities, some of which include:
…
-
* http://outlace.com/Lean_part_1.html
* https://typista.org/lean-for-scala-programmers/
* https://icerm.brown.edu/video_archive/?play=2906
-
1. What source book, article, etc did you use to figure out how to code this?
2. How does your resolution algorithm work?
3. How does your proof checking algorithm work?
4. Would you be interested…