ویراساینس.
سند علمی

Programming Language Expressiveness and Circuit Complexity

Denis Dancanet, Stephen Brookes

چکیده

This paper is a continuation of the work begun in 5] on establishing relative intensional expressiveness results for programming languages. Language L 1 is intensionally more expressive than L 2 , if L 1 can compute all the functions L 2 can, with at least the same asymptotic complexity. The question we address is: Does nondeterministic parallelism add intensional expressiveness? We compare deterministic and nondeterministic extensions of PCF, a simple functional programming language. We develop further the circuit semantics from our earlier work, and establish a connection between parallel PCF programs and boolean circuits. Using results from circuit complexity, and assuming hardware which can detect undeened inputs, we show that nondeterministic parallelism is indeed intensionally more expressive. More precisely, we show that nondeterministic parallelism can lead to exponentially faster programs, and also programs that do exponentially less work.

اسناد مشابه

  • A Modal Programming Language for Representing Complex Actions

    سند علمی۱۹۹۸Matteo Baldoni, Laura Giordano, Alberto Martelli, Viviana Patti

    In this paper we propose a modal approach for reasoning about dynamic domains in a logic programming setting. In particular we deene a language, called DyLOG, in which actions are naturally represented by modal operators. DyLOG is a language for reasoning about actions which allo

  • Trading off Complexity for Expressiveness in Programming Languages for Embedded Devices: Visions and Experiences

    سند علمی۲۰۱۱Vincenzo De Florio, Chris Blondia

    When programming resource-scarce embedded smart devices the designer requires both the low-level system programming features of a language such as C and higher level capability typical of a language like Java. The choice of a particular language often implies trade offs between c

  • A programming language for composable DNA circuits.

    سند علمی۲۰۰۹Journal of the Royal Society, InterfaceAndrew Phillips, Luca Cardelli

    Recently, a range of information-processing circuits have been implemented in DNA by using strand displacement as their main computational mechanism. Examples include digital logic circuits and catalytic signal amplification circuits that function as efficient molecular detectors

  • SyReC: A Programming Language for Synthesis of Reversible Circuits

    سند علمی۲۰۱۰MBMVRobert Wille, Sebastian Offermann, Rolf Drechsler

    Reversible logic serves as a basis for emerging technologies like quantum computing and additionally has applications in low-power design. In particular, since traditional technologies like CMOS are going to reach their limits in the near future, reversible logic has been establi

  • On the Circuit Complexity of Random Generation Problems for Regular and Context-Free Languages

    سند علمی۲۰۰۱STACSMassimiliano Goldwurm, Beatrice Palano, Massimo Santini

    We study the circuit complexity of generating at random a word of length n from a given language under uniform distribution. We prove that, for every language accepted in polynomial time by 1-NAuxPDA of polynomially bounded ambiguity, the problem is solvable by a logspace-uniform

  • On the Expressive Power of Programming Languages

    سند علمی۱۹۹۰Sci. Comput. Program.Matthias Felleisen

    The literature on programming languages contains an abundance of informal claims on the relative expressive power of programming languages, but there is no framework for formalizing such statements nor for deriving interesting consequences. As a rst step in this direction, we dev