Bern Martens

According to our database1, Bern Martens authored at least 38 papers between 1988 and 2018.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2018
Co-de: an online learning platform for computational thinking.
Proceedings of the 13th Workshop in Primary and Secondary Computing Education, 2018

2017
Bringing Algorithms to Flemish Classrooms: Teaching the Teachers, and some Students.
Proceedings of the 12th Workshop on Primary and Secondary Computing Education, 2017

2014
Starting from scratch: experimenting with computer science in Flemish secondary education.
Proceedings of the 9th Workshop in Primary and Secondary Computing Education, 2014

2013
Positioning computer science in Flemish K-12 education: a reflection.
Proceedings of the 8th Workshop in Primary and Secondary Computing Education, 2013

2006
IT, Ethics and Education : Teaching the Teachers (and their Pupils).
Proceedings of the Information Society: Innovation, Legitimacy, Ethics and Democracy In honor of Professor Jacques Berleur s.j., 2006

2000
Erratum to: "Conjunctive Partial Deduction: Foundations, Control, Algorithms and Experiments".
J. Log. Program., 2000

Project Report on LP<sup>+</sup>: A Second Generation Logic Programming Language.
AI Commun., 2000

1999
Conjunctive Partial Deduction: Foundations, Control, Algorithms, and Experiments.
J. Log. Program., 1999

Bottom-up Partial Deduction of Logic Programs
J. Funct. Log. Program., 1999

1998
Controlling Generalization amd Polyvariance in Partial Deduction of Normal Logic Programs.
ACM Trans. Program. Lang. Syst., 1998

Some Achievements and Prospects in Partial Deduction.
ACM Comput. Surv., 1998

A Framework for Bottom Up Specialisation of Logic Programs.
Proceedings of the Principles of Declarative Programming, 10th International Symposium, 1998

Bottom-Up Specialisation of Logic Programs.
Proceedings of the Logic Programming Synthesis and Transformation, 1998

Specialising the Other Way Arond.
Proceedings of the 1998 Joint International Conference and Symposium on Logic Programming, 1998

1997
To Parse or Not To Parse.
Proceedings of the Logic Programming Synthesis and Transformation, 1997

Preserving Termination of Tabled Logic Programs While Unfolding.
Proceedings of the Logic Programming Synthesis and Transformation, 1997

Termination Analysis for Tabled Logic Programming.
Proceedings of the Logic Programming Synthesis and Transformation, 1997

1996
Automatic Finite Unfolding Using Well-Founded Measures.
J. Log. Program., 1996

Controlling Conjunctive Partial Deduction.
Proceedings of the Programming Languages: Implementations, 1996

Conjunctive Partial Deduction in Practice.
Proceedings of the Logic Programming Synthesis and Transformation, 1996

Global Control for Partial Deduction through Characteristic Atoms and Global Trees.
Proceedings of the Partial Evaluation, International Seminar, 1996

1995
Why Untyped Nonground Metaprogramming Is Not (Much Of) A Problem.
J. Log. Program., 1995

Tutorial on Program Specialisation (Abstract).
Proceedings of the Logic Programming, 1995

Partial Deduction of the Ground Representation and its Application to Integrity Checking.
Proceedings of the Logic Programming, 1995

Ensuring Global Termination of Partial Deduction while Allowing Flexible Polyvariance.
Proceedings of the Logic Programming, 1995

Generating Specialised Update Procedures Through Partial Deduction of the Ground Representation.
Proceedings of the Deductive Databases and Logic Programming, 1995

1994
On the semantics of meta-programming and the control of partial deduction in logic programming.
PhD thesis, 1994

Sound and Complete Partial Deduction with Unfolding Based on Well-Founded Measures.
Theor. Comput. Sci., 1994

1993
Some Further Issues in Finite Unfolding (Abstract).
Proceedings of the Logic Program Synthesis and Transformation, 1993

1992
A General Criterion for Avoiding Infinite Unfolding during Partial Deduction.
New Gener. Comput., 1992

A Perfect Herbrand Semantics for Untyped Vanilla Meta-Programming.
Proceedings of the Logic Programming, 1992

Sound and Complete Partial Deduction with Unfolding Based on Well-Founded Measures.
Proceedings of the International Conference on Fifth Generation Computer Systems. FGCS 1992, 1992

A sensible least Herbrand semantics for untyped Vanilla meta-programming and its extension to a limited form of amalgamation.
Proceedings of the CNKBS'92, 1992

1991
Compiling Bottom-up and Mixed Derivations into Top-down Executable Logic Programs.
J. Autom. Reason., 1991

A General Criterion for Avoiding Infinite Unfolding During Partial Deduction of Logic Programs.
Proceedings of the Logic Programming, Proceedings of the 1991 International Symposium, San Diego, California, USA, Oct. 28, 1991

Integrity Verification in Knowledge Bases.
Proceedings of the Logic Programming, First Russian Conference on Logic Programming, Irkutsk, Russia, September 14-18, 1990, 1991

Integrity Constraints and Interactive Concept-Learning.
Proceedings of the Eighth International Workshop (ML91), 1991

1988
Integrity Constraint Checking in Deductive Databases Using a Rule/Goal Graph.
Proceedings of the Expert Database Systems, 1988


  Loading...