Received: from leopard.cs.byu.edu (leopard.cs.byu.edu [128.187.2.182]) by ra.abo.fi (8.6.10/8.6.10) with ESMTP id VAA11031; Thu, 2 Nov 1995 21:55:45 +0200
Received: by leopard.cs.byu.edu
	(1.37.109.15/16.2) id AA068485391; Thu, 2 Nov 1995 11:03:11 -0700
Sender: info-hol-request@leopard.cs.byu.edu
Errors-To: info-hol-request@leopard.cs.byu.edu
Precedence: list
Received: from bunsen.cs.byu.edu by leopard.cs.byu.edu with ESMTP
	(1.37.109.15/16.2) id AA068435390; Thu, 2 Nov 1995 11:03:10 -0700
Received: from tuminfo2.informatik.tu-muenchen.de (tuminfo2.informatik.tu-muenchen.de [131.159.0.81]) 
  by bunsen.cs.byu.edu (8.6.9/8.6.9) with ESMTP
  id LAA19785 for <info-hol@cs.byu.edu>; Thu, 2 Nov 1995 11:01:34 -0700
Received: from sunbroy14.informatik.tu-muenchen.de ([131.159.0.114]) by tuminfo2.informatik.tu-muenchen.de with SMTP id <26669-2>; Thu, 2 Nov 1995 17:02:14 +0100
Received: by sunbroy14.informatik.tu-muenchen.de id <8099>; Thu, 2 Nov 1995 17:01:58 +0100
From: Konrad Slind <slind@informatik.tu-muenchen.de>
To: info-hol@cs.byu.edu
Message-Id: <95Nov2.170158met.8099@sunbroy14.informatik.tu-muenchen.de>
Date: 	Thu, 2 Nov 1995 17:01:52 +0100


Does anybody know of any pointers to the subject of computational
complexity of higher-order functional programs? The few papers that I've
found are A) theoretical and B) restricted to functions over ground
types. If anybody who has an overview of the state-of-the-art would drop
me a line, I would be grateful.

Thanks,
Konrad.