Cons-free Programming with Immutable Functions
نویسنده
چکیده
We investigate the power of non-determinism in purely functional programming languages with higher-order types. Specifically, we set out to characterise the hierarchy NP ( NEXP ( NEXP ( · · · ( NEXP ( · · · solely in terms of higher-typed, purely functional programs. Although the work is incomplete, we present an initial approach using cons-free programs with immutable functions.
منابع مشابه
The TTC 2014 FIXML Case: Rascal Solution
Rascal is a meta-programming language for source code analysis and transformation [1, 2]. Concretely, it is targeted at analyzing and processing any kind of “source code in the broad sense”; this includes importing, analyzing, transforming, visualizing and generating, models, data files, program code, documentation, etc. Rascal is a functional programming language in that all data is immutable ...
متن کاملThe TTC 2014 Movie Database Case: Rascal Solution
Rascal is a meta-programming language for source code analysis and transformation [2, 3]. Concretely, it is targeted at analyzing and processing any kind of “source code in the broad sense”; this includes importing, analyzing, transforming, visualizing and generating, models, data files, program code, documentation, etc. Rascal is a functional programming language in that all data is immutable ...
متن کاملPreliminary Proceedings of the 7 th International Workshop on Expressiveness in Concurrency
Compare rst-order functional programs with higher-order programs allowing functions asfunction parameters. Can the the rst program class solve fewer problems than the second?The answer is no: both classes are Turing complete, meaning that they can compute allpartial recursive functions. In particular, higher-order values may be rst-order simulatedby use of the list constructor \...
متن کاملOn First-order Cons-free Term Rewriting and PTIME
In this paper, we prove that (first-order) cons-free term rewriting with a call-by-value reduction strategy exactly characterises the class of PTIME-computable functions. We use this to give an alternative proof of the result by Carvalho and Simonsen which states that cons-free term rewriting with linearity constraints characterises this class.
متن کاملComplexity Hierarchies and Higher-order Cons-free Term Rewriting
Constructor rewriting systems are said to be cons-free if, roughly, constructor terms in the right-hand sides of rules are subterms of the left-hand sides; the computational intuition is that rules cannot build new data structures. In programming language research, cons-free languages have been used to characterize hierarchies of computational complexity classes; in term rewriting, cons-free fi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1711.03424 شماره
صفحات -
تاریخ انتشار 2017