Had a meeting with the CETS (something like "computing services" or "CS facilities" in CMUese) about potential applications, which was productive. I think I may have figured out a new super-nice no-logical-relations proof technique for showing metric soundness of the type system that may be amenable to Twelf proof, even. It's interesting to me that the technique seems very blatantly not to generalize to something that would let you get rid of logical relations for describing contextual equivalence, which means exactly that I think it has a chance of working.
Had a meeting with the CETS (something like "computing services" or "CS facilities" in CMUese) about potential applications, which was productive. I think I may have figured out a new super-nice no-logical-relations proof technique for showing metric soundness of the type system that may be amenable to Twelf proof, even. It's interesting to me that the technique seems very blatantly not to generalize to something that would let you get rid of logical relations for describing contextual equivalence, which means exactly that I think it has a chance of working.
-
(no subject)
A paper on describing circuits in an agda DSL: http://www.staff.science.uu.nl/~swier004/publications/2015-types-draft.pdf
-
(no subject)
Going more carefully now through this little tutorial on fpga programming with the iCEstick. It's in spanish, which makes it slightly more…
-
(no subject)
Some further progress cleaning up the https://xkcd.com/1360/ -esque augean stables that is my hard drive. Tomato chicken I made a couple days ago…
- Post a new comment
- 2 comments
- Post a new comment
- 2 comments
