Results 1  10
of
10
On the Expressive Power of the Loop Language
 Nordic Journal of Computing
, 2006
"... imperative programming language similar to the Loop language described by Meyer and Ritchie ..."
Abstract

Cited by 4 (4 self)
 Add to MetaCart
imperative programming language similar to the Loop language described by Meyer and Ritchie
Programming Language Expressiveness and Circuit Complexity
 in: Internat. Conf. on the Mathematical Foundations of Programming Semantics
, 1996
"... 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 questi ..."
Abstract

Cited by 4 (2 self)
 Add to MetaCart
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 undefined 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. 1 Introduction We conduct an inves...
Classes of Algorithms: Formalization and Comparison
, 2012
"... We discuss two questions about algorithmic completeness (in the operational sense). First, how to get a mathematical characterization of the classes of algorithms associated to the diverse computation models? Second, how to define a robust and satisfactory notion of primitive recursive algorithm? We ..."
Abstract
 Add to MetaCart
We discuss two questions about algorithmic completeness (in the operational sense). First, how to get a mathematical characterization of the classes of algorithms associated to the diverse computation models? Second, how to define a robust and satisfactory notion of primitive recursive algorithm? We propose solutions based on Gurevich’s Abstract State Machines. Contents 1
THE EATCS COLUMNS
"... We discuss two questions about algorithmic completeness (in the operational sense). First, how to get a mathematical characterization of the classes of algorithms associated to the diverse computation models? Second, how to define a robust and satisfactory notion of primitive recursive algorithm? We ..."
Abstract
 Add to MetaCart
We discuss two questions about algorithmic completeness (in the operational sense). First, how to get a mathematical characterization of the classes of algorithms associated to the diverse computation models? Second, how to define a robust and satisfactory notion of primitive recursive algorithm? We propose solutions based on Gurevich’s Abstract State Machines.
Theoretical Informatics and Applications Informatique Théorique et Applications Will be set by the publisher A COMPLETE CHARACTERIZATION OF PRIMITIVE RECURSIVE INTENSIONAL BEHAVIOURS
"... Abstract. We give a complete characterization of the class of functions that are the intensional behaviours of Primitive Recursive algorithms. This class is the set of primitive recursive functions that have a null basic case of recursion. This result is obtained using the property of ultimate unari ..."
Abstract
 Add to MetaCart
Abstract. We give a complete characterization of the class of functions that are the intensional behaviours of Primitive Recursive algorithms. This class is the set of primitive recursive functions that have a null basic case of recursion. This result is obtained using the property of ultimate unarity and a geometrical approach of sequential functions on N the set of positive integers. AMS Subject Classification. — Give AMS classification codes —. 1.
Circuit Semantics and Intensional Expressivity
, 1996
"... We introduce a new denotational semantics for functional programming languages and use it to reason about intensional aspects of programs. Circuit semantics associates a gate with each basic construct of the language, and takes the meaning of a program to be a circuit. The dimensions of the circuit ..."
Abstract
 Add to MetaCart
We introduce a new denotational semantics for functional programming languages and use it to reason about intensional aspects of programs. Circuit semantics associates a gate with each basic construct of the language, and takes the meaning of a program to be a circuit. The dimensions of the circuit enable reasoning about running time and work required for execution. We use circuit semantics to obtain relative intensional expressiveness results between various deterministic and nondeterministic parallel extensions of PCF. 1 Introduction We are interested in establishing relative intensional expressiveness results for programming languages. Most work in the past has focused on extensional expressiveness: Language L 1 is extensionally more expressive than L 2 if L 1 can compute all the functions computable in L 2 . We say that language L 1 is intensionally more expressive than L 2 , if L 1 can compute all the functions computable in L 2 , with at least the same asymptotic complexity. T...
An Intensional Investigation of Parallelism
, 1994
"... Denotational semantics is usually extensional in that it deals only with input/output properties of programs by making the meaning of a program a function. Intensional semantics maps a program into an algorithm, thus enabling one to reason about complexity, order of evaluation, degree of parallelism ..."
Abstract
 Add to MetaCart
Denotational semantics is usually extensional in that it deals only with input/output properties of programs by making the meaning of a program a function. Intensional semantics maps a program into an algorithm, thus enabling one to reason about complexity, order of evaluation, degree of parallelism, efficiencyimproving program transformations, etc. I propose to develop intensional models for a number of parallel programming languages. The semantics will be implemented, resulting in a programming language of parallel algorithms, called CDSP. Applications of CDSP will be developed to determine its suitability for actual use. The thesis will hopefully make both theoretical and practical contributions: as a foundational study of parallelism by looking at the expressive power of various constructs, and with the design, implementation, and applications of an intensional parallel programming language. 1 Introduction Denotational semantics has now been around for about 25 years, which makes...