Searching for authors named "Johan Bevemyr" – sorted by Relevance.
-
Data-parallel Implementation of Prolog
- UPPSALA THESES IN COMPUTING SCIENCE 25 Data-parallel Implementation of Prolog Johan Bevemyr
- Add To MetaCart
-
A Generational Parallel Copying Garbage Collector for Shared Memory Prolog
- Garbage Collector for Shared Memory Prolog Johan Bevemyr Computing Science Dept., Uppsala University e
- Add To MetaCart
-
A Recursion Parallel Prolog Engine
- UPPSALA THESES IN COMPUTING SCIENCE No. 16/93 A Recursion Parallel Prolog Engine Johan Bevemyr
- Cited by 5 (2 self) – Add To MetaCart
-
Prolog with Arrays and Bounded Quantifications
- Jonas Barklund and Johan Bevemyr Uppsala University, Computing Science Dept. E-mail: jonas
- Cited by 11 (2 self) – Add To MetaCart
-
A Simple and Efficient Copying Garbage Collector for Prolog
- Collector for Prolog Johan Bevemyr Thomas Lindgren Box 311, S-751 05 Uppsala, Sweden Phone: +48\Gamma18
- Cited by 16 (3 self) – Add To MetaCart
-
Parallel Bounded Quantification-Preliminary Results
- ---Preliminary Results Henrik Arro, Jonas Barklund and Johan Bevemyr UPMAIL, Computing Science Dept. Uppsala University
- Cited by 4 (1 self) – Add To MetaCart
-
Compiler optimizations in Reform Prolog: experiments on the KSR-1 multiprocessor
- : experiments on the KSR-1 multiprocessor Thomas Lindgren, Johan Bevemyr and Hakan Millroth Computing Science
- Cited by 2 (0 self) – Add To MetaCart
-
Exploiting Recursion-Parallelism in Prolog
- Exploiting Recursion-Parallelism in Prolog Johan Bevemyr Thomas Lindgren Hakan Millroth Computing
- Cited by 3 (1 self) – Add To MetaCart
-
Reform Prolog: The Language and its Implementation
- Reform Prolog: The Language and its Implementation Johan Bevemyr Thomas Lindgren Hakan Millroth
- Cited by 25 (3 self) – Add To MetaCart
-
On Taylor's Scheme for Unbound Variables
- Variables Thomas Lindgren Per Mildner Johan Bevemyr Computing Science Department, Uppsala University e
- Cited by 7 (0 self) – Add To MetaCart

