Data parallel dialect of scheme: outline of the formal model, implementation, performance

Authors:
Petr Krajca;Vilem Vychodil
Affiliations:
SUNY Binghamton, Watson School, Binghamton, NY;SUNY Binghamton, Watson School, Binghamton, NY
Venue:
Proceedings of the 2009 ACM symposium on Applied Computing
Year:
2009

Citing 4
Cited 1

Transputer-based emulation of a data-driven LISP machine: BIDDLE

Journal of Systems and Software
The Implementation of Functional Programming Languages (Prentice-Hall International Series in Computer Science)

The Implementation of Functional Programming Languages (Prentice-Hall International Series in Computer Science)
Data parallel Haskell: a status report

Proceedings of the 2007 workshop on Declarative aspects of multicore programming
Implicitly parallel programming models for thousand-core microprocessors

Proceedings of the 44th annual Design Automation Conference

Software transactional memory for implicitly parallel functional language

Proceedings of the 2010 ACM Symposium on Applied Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

We outline new functional programming language and stack-based model of implicit parallel execution of programs. The language, called Schemik, is high-level lexically-scoped implicitly-parallel dialect of Scheme. Schemik is designed as an implicitly parallel language, meaning that the parallel execution of programs is done independently of the programmer and each program written in Schemik always produces the same results no matter which parts of the program are executed simultaneously. The execution of programs is formally described by transitions of a particular pushdown automaton working with two stacks. Because of the limited scope of this paper, we just outline key ideas and postpone detailed description to a full version of this paper.