Home
- 562haskell,
- 504artículo,
- 502curso,
- 341lógica,
- 289RA,
- 258libro,
- 241formalización,
- 231Isabelle,
- 227vestigium,
- 215matemáticas
The goal of CIS 120 is to introduce students to computer science by emphasizing the design aspects of programming
May
19
2012
Automatically prove properties about Haskell programs by using induction or coinduction. The approach taken is to compile Haskell programs to first order theories. Induction is applied on the meta level, and proof search is carried out by automated theorem provers for first order logic with equality.
-
ery optimistic projections, coupled with an underestimation of the time and effort needed to produce intelligence in machine
-
Given such a fantasy portrayal it is not surprising that reality may seem a little out of step with expectation
- 22 more annotation(s)...
May
17
2012
This article documents the automated assistant (aartifact) for formal reasoning integrated into this instance of MediaWiki.
aartifact is a prototype infrastructure for defining, implementing, and maintaining user-accessible web-based integrated formal reasoning environments.
In this course you will learn several fundamental principles of algorithm design: divide-and-conquer methods, graph algorithms, practical data structures, randomized algorithms, and more.
Top Tags
View All Recent Tags (10)
J.A. Alonso's Public Lists (1)
Diigo is about better ways to research, share and collaborate on information. Learn more »
Join Diigo