muenchen.haskell.bayern
Haskell Meeting in Munich
http://muenchen.haskell.bayern/dates.html
The meetings begin at 19h30, German time. Usual venue is Cafe Puck. Cafe Puck is being fully renovated currently.) The rule of thumb is that the meeting takes place in rotation on the last Monday, Tuesday, Wednesday, Thursday of the month. Our next meeting is scheduled on Tue, 28 Feb 2017. Around 19h30. We'll meet at Augustiner-Gaststätte Rumpler (Baumstraße 21). Please sign up here. If you are coming. Please help us to reserve enough tables for this event! Tue, 28 Feb 2017. Wed, 29 Mar 2017. Meeting at ...
abella-prover.org
Abella
http://abella-prover.org/index.html
On Abella has been published in the Journal of Formalized Reasoning. Abella is an interactive theorem prover based on lambda-tree syntax. This means that Abella is well-suited for reasoning about the meta-theory of programming languages and other logical systems which manipulate objects with binding. For example, the following applications are included in the distribution of Abella. Various results on the lambda calculus involving big-step evaluation, small-step evaluation, and typing judgments. System f...
tsouanas.org
Porting Teyjus to OpenBSD
http://www.tsouanas.org/teyjus
Porting Teyjus to OpenBSD. In the off chance that the intersection of the set of OpenBSD. Users with the set of λProlog. Users is not a singleton, you might find these notes on installing Teyjus. When I find the time I'll create a port for it. It is quite possible that the same instructions would help someone port Teyjus to other *BSD systems like FreeBSD. But I have only tested it on OpenBSD, and only on the amd64 platform. To summarize, the problems with Teyjus are:. It relies on the non-standard.
concrete-mix.blogspot.com
Concrete Mix: October 2009
http://concrete-mix.blogspot.com/2009_10_01_archive.html
Friday, October 23, 2009. The last couple of posts have been a bit off topic (where topic = Mix), so let's get back to it. These words are about methods in Mix, how they are implemented, and how the implementation choice corresponds closely to the language's semantics (which seems like a bad idea, but you'll see what I mean). It's easy to see how regular class instances are objects (it's by definition, right? This gets us into a bit of a loop; if methods are objects, then this. Method that is callable.
