The YNot Project
The goal of the Ynot project is to make programming with dependent types practical for a modern programming language.
In particular, we are extending the Coq proof assistant to make it possible to write higher-order, imperative and concurrent programs (in the style of Haskell) through a shallow embedding of Hoare Type Theory (HTT).
HTT provides a clean separation between pure and effectful computations, makes it possible to formally specify and reason about effects, and...
This Week’s Ruby News: Ruby 1.9.3p0, OmniAuth 1.0,...
The rapid descent of the weather towards winter is getting people to stay in and code and long may it continue given the quality of this week's releases: OmniAuth 1.0, MagLev 1.0, and Ruby...
Adding Type Constructor Parameterization to Java
Vincent Cremet and Philippe Altherr: Adding Type Constructor Parameterization to Java, JOT vol. 7, no. 5. We present a generalization of Java’s parametric polymorphism that enables...
A Lambda Calculus for Real Analysis
A Lambda Calculus for Real Analysis Abstract Stone Duality is a revolutionary paradigm for general topology that describes computable continuous functions directly, without using set theory,...
Post new comment