Johan Bevemyr

According to our database, Johan Bevemyr authored at least 10 papers between 1992 and 1997.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

1997

A Pragmatic Approach to Compilation of Erlang.

Erik Johansson, Christer Jonsson, Thomas Lindgren, Johan Bevemyr, Håkan Millroth

Proceedings of the Programming Languages: Implementations, 1997

1996

Prolog with arrays and bounded quantifications.

Jonas Barklund, Johan Bevemyr

J. Program. Lang., 1996

1995

Compiler Optimizations in Reform Prolog: Experiments on the KSR-1 Multiprocessor.

Thomas Lindgren, Johan Bevemyr, Håkan Millroth

Proceedings of the Euro-Par '95 Parallel Processing, 1995

1994

A Simple and Efficient Copying Garbage Collector for Prolog.

Johan Bevemyr, Thomas Lindgren

Proceedings of the Programming Language Implementation and Logic Programming, 1994

1993

Parallel Bounded Quantification - Preliminary Results.

Henrik Arro, Jonas Barklund, Johan Bevemyr

ACM SIGPLAN Notices, 1993

Executing Bounded Quantifications on Shared Memory Multiprocessors.

Jonas Barklund, Johan Bevemyr

Proceedings of the Programming Language Implementation and Logic Programming, 1993

Exploiting Recursion-Parallelism in Prolog.

Johan Bevemyr, Thomas Lindgren, Håkan Millroth

Proceedings of the PARLE '93, 1993

Reform Prolog: The Language and Its Implementation.

Johan Bevemyr, Thomas Lindgren, Håkan Millroth

Proceedings of the Logic Programming, 1993

1992

Exploiting Recursion-Parallelism in Prolog: Preliminary Results.

Johan Bevemyr, Thomas Lindgren, Håkan Millroth

Proceedings of the Workshop on Concurrent and Parallel Implementations (sessions A and B), 1992

Parallel Bounded Quantifiers - Preliminary Results.

Henrik Arro, Jonas Barklund, Johan Bevemyr

Proceedings of the Workshop on Concurrent and Parallel Implementations (sessions A and B), 1992