Article View: comp.theory
Article #1874Re: Adding Constraints to Automate Programming
From: Bill Pugh
Date: Thu, 28 Jan 1993 22:27
Date: Thu, 28 Jan 1993 22:27
20 lines
1107 bytes
1107 bytes
In article <BAZET.93Jan27195118@chailly.ensmp.fr> bazet@chailly.ensmp.fr (Philippe BAZET) writes: >Let us consider a circular list. It can be defined by an ML-like data >type such as > > list 'a = nil | cons of 'a * list 'a ; > >and the assertion: > > The last element for the list is the first one. > >Does anyone know of programming systems in which such assertions can be >expressed formally and used at either run-time or compile-time? Check out the paper "Graph Types" by Nils Klarlund and Michael Schwartzback in the 93 POPL conference. Bill Pugh Dept. of Computer Science Univ. of Maryland, College Park pugh@cs.umd.edu
Technical Details
Message-ID:
<63817@mimsy.umd.edu>Path:
arc1-ca.pugleaf.net!sparky!uunet!ukma!usenet.ins.cwru.edu!agate!ames!haven.umd.edu!mimsy!pughReferences:
<BAZET.93Jan27195118@chailly.ensmp.fr>Show Full Headers
Complete Article Headers
Path: arc1-ca.pugleaf.net!sparky!uunet!ukma!usenet.ins.cwru.edu!agate!ames!haven.umd.edu!mimsy!pugh From: pugh@cs.umd.edu (Bill Pugh) Newsgroups: comp.theory Subject: Re: Adding Constraints to Automate Programming Message-ID: <63817@mimsy.umd.edu> Date: 28 Jan 93 22:27:48 GMT References: <BAZET.93Jan27195118@chailly.ensmp.fr> Sender: news@mimsy.umd.edu Distribution: comp Organization: U of Maryland, Dept. of Computer Science, Coll. Pk., MD 20742 Lines: 23