Re: Bird-Meertens Formalism

Article View: comp.lang.functional

Article #75

Back to comp.lang.functional Previous Next

#75

From: Leo Fegaras
Date: Thu, 23 Jul 1992 16:03

14 lines
1070 bytes

Nico Verwer writes:

>                                                               On the
> other hand, there is not yet a system for automatic reasoning in BMF.

There is an automatic theorem prover based on Fokkinga's paramorphisms.
This work is described in the paper:
L. Fegaras, T. Sheard, and D. Stemple.
"Uniform Traversal Combinators: Definition, Use and Properties"
In eleventh International Conference on Automated Deduction
(CADE-11), Saratoga Springs, New York, June 1992.

Leo Fegaras

Technical Details

Message-ID: <50771@dime.cs.umass.edu>

Path: arc1-ca.pugleaf.net!sparky!uunet!olivea!decwrl!sdd.hp.com!caen!nic.umass.edu!dime!freya.cs.umass.edu!fegaras

References: <1992Jul20.160706.10025@cs.ruu.nl> <1992Jul21.130843.16294@sci.kun.nl> <1992Jul22.145710.17064@cs.ruu.nl>

Show Full Headers

Complete Article Headers

Path: arc1-ca.pugleaf.net!sparky!uunet!olivea!decwrl!sdd.hp.com!caen!nic.umass.edu!dime!freya.cs.umass.edu!fegaras
From: fegaras@freya.cs.umass.edu (Leo Fegaras)
Newsgroups: comp.lang.functional
Subject: Re: Bird-Meertens Formalism
Keywords: Program Derivation, Calculational Approach
Message-ID: <50771@dime.cs.umass.edu>
Date: 23 Jul 92 16:03:33 GMT
References: <1992Jul20.160706.10025@cs.ruu.nl> <1992Jul21.130843.16294@sci.kun.nl> <1992Jul22.145710.17064@cs.ruu.nl>
Sender: news@dime.cs.umass.edu
Organization: University of Massachusetts, Amherst
Lines: 14

Reply to Parent Message