Peter Møller Neergaard  Home/Search
Context
Related
| churchproject.org...dbrtcl2004.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: bu.edu/reports/...aardbrtcl2004 (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We present BC # which is a function algebra that is sound and complete for LOGSPACE. (Update)
Active bibliography (related documents): More All
0.9: A Functional Language for Logarithmic Space - Neergaard (2004) (Correct)
0.6: The Expressive Power of Higher-order Types or, Life without CONS - Jones (Correct)
0.2: Semantics of Linear/modal Lambda Calculus - Hofmann (1998) (Correct)
Similar documents based on text: More All
0.2: The Relative Power Of Logspace And Polynomial Time Reductions - Buhrman, Spaan, Torenvliet (Correct)
0.2: Weak and Strong Normalization, K-redexes, and First-Order Logic - Neergaard (1999) (Correct)
0.2: Unambiguity and Fewness for Logarithmic Space - Buntrock, Jenner, Lange.. (1991) (Correct)
BibTeX entry: (Update)
@misc{ neergaard-bcepsilon,
author = "Peter Møller Neergaard",
title = "BC_ε: Recursion-Theoretic Characterization of LOGSPACE",
url = "citeseer.ist.psu.edu/neergaard04bcepsilon.html" }
Citations (may not include all citations):1074 The Definition of Standard ML (context) - Milner, Tofte et al. - 1997
729 The Lambda Calculus: Its Syntax and Semantics (context) - Barendregt - 1984
115 Revised report on the algorithmic language Scheme - Kelsey, Clinger et al. - 1998
96 A new recursion-theoretic characterization of the polytime f.. (context) - Bellantoni, Cook - 1992
54 Space-bounded reducibility among combinatorial problems (context) - Jones - 1975
21 Light linear logic - Girard - 1998
12 Proper tail recursion and space efficiency - Clinger - 1998
12 Characterizing complexity classes by higher type primitive r.. (context) - Goerdt - 1992
12 Recursive Functions (context) - eter - 1967
6 Recursion versus iteration at higher-orders - Kfoury - 1997
4 Light affine logic - Asperti - 1998
3 tail-recursion and iteration at higher-orders (context) - Kfoury - 1999
3 The expressive power of higher-order types (context) - Jones - 2001
2 Can safe recursion be interpreted in light logic (context) - Murawski, Ong - 2000
1 How light is safe recursion (context) - Neergaard, Mairson - 2003
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC