queuea9.wordpress.com
Getting your Agda code to type-check faster | QA9
https://queuea9.wordpress.com/2015/07/01/getting-your-agda-code-to-type-check-faster
Exploring the Computational Logic Literature. Getting your Agda code to type-check faster. July 1, 2015 – 2:04 pm. As I, like many others of good will and high aspiration, battle the POPL ’16 submission deadline, I feel compelled to write a quick post about how to get your Agda code through the type-checker faster. For my submission fight, I have got about 3000 lines of Agda that is intended to be compiled and executed (imagine! Argh Here are three things I did that seemed to help (YMMV, of course):.
queuea9.wordpress.com
Complete partial order of Herbrand models | QA9
https://queuea9.wordpress.com/2014/10/06/complete-partial-order-of-herbrand-models
Exploring the Computational Logic Literature. Complete partial order of Herbrand models. October 6, 2014 – 7:58 pm. Posted in Group news. In our Computational Logic seminar here at The University of Iowa, we are studying logic programming this semester. We are using the very nice book “Logic, Programming, and Prolog”, freely available online. We were talking today about the existence of a least Herbrand model for a definite program. A definite program is just a set of clauses of the form. Be a subset of.
queuea9.wordpress.com
Coming back to iteration | QA9
https://queuea9.wordpress.com/2014/08/15/coming-back-to-iteration
Exploring the Computational Logic Literature. Coming back to iteration. August 15, 2014 – 11:49 am. I haven’t yet started repeating myself — though there’s every chance you’ll hear it here twice — but iteration is the sort of thing one can find just one use after another for. I mean, if you’ve seen it once, you’ve seen it a thousand times: iteration delivers repeatedly. How many times have you iterated to good effect? I say again: is iteration great or what? In my standard library. Div-result : ℕ ℕ Set.
queuea9.wordpress.com
The perils of predicativity and its opposite | QA9
https://queuea9.wordpress.com/2015/04/21/the-perils-of-predicativity-and-its-opposite
Exploring the Computational Logic Literature. The perils of predicativity and its opposite. April 21, 2015 – 7:55 pm. Posted in Type Theory. Forget squabbles over comment characters (I do think I prefer Haskell/Agda’s now over OCaml’s — sorry! This is why in Luo’s Extended Calculus of Constructions. ECC), which is part of the type theory of Coq, only the base level of the universe hierarchy is impredicative, and the other levels are predicative. And that these datatypes are the reason that Coq enforces s...
queuea9.wordpress.com
The square root of two proof | QA9
https://queuea9.wordpress.com/2015/01/27/the-square-root-of-two-proof
Exploring the Computational Logic Literature. The square root of two proof. January 27, 2015 – 4:11 pm. Most QA9 readers will know the nonconstructive proof that there are two irrational numbers a and b such that a to the power b is rational. There is interesting discussion about this here. I recently came across a 2014 note by Roger Hindley. It’s a Math tweet from 1953. Laquo; Complete partial order of Herbrand models. The perils of predicativity and its opposite. Leave a Reply Cancel reply. Create a fr...
queuea9.wordpress.com
QA9 | Exploring the Computational Logic Literature | Page 2
https://queuea9.wordpress.com/page/2
Exploring the Computational Logic Literature. Getting your Agda code to type-check faster. July 1, 2015 – 2:04 pm. As I, like many others of good will and high aspiration, battle the POPL ’16 submission deadline, I feel compelled to write a quick post about how to get your Agda code through the type-checker faster. For my submission fight, I have got about 3000 lines of Agda that is intended to be compiled and executed (imagine! Argh Here are three things I did that seemed to help (YMMV, of course):.
adam.chlipala.net
Adam Chlipala - Past Research Students
http://adam.chlipala.net/past.html
Adam Chlipala - Past Research Students. Now a developer at Originate. Now a software engineer at Coverity. Now an engineer at Cryptosense. Joint papers: verifying mini-Bluespec programs in Coq. Reflective tactics for separation logic. Co-advised with Greg Morrisett. Now a postdoc at UCSD. Thesis: Extensible Proof Engineering in Intensional Type Theory. Joint papers: automated proofs in Ynot. Reflective tactics for separation logic. Now a software engineer at Google. Now a software engineer at Dropbox.
queuea9.wordpress.com
Category list | QA9
https://queuea9.wordpress.com/my-categories
Exploring the Computational Logic Literature. This is a list of the categories I use, with brief explanations:. In the Light of Logic. 8212; posts about the book with this title, by Solomon Feferman. 8212; posts summarizing papers that I highly recommend. 8212; posts about different algorithmic methods for showing functions terminate in type theory. 8212; notes from workshops, conferences, and other meetings I attend. 8212; occasional posts on philosophy of logic or mathematics. Join 15 other followers.
SOCIAL ENGAGEMENT