Birgit Elbl - List of Publications


B. Elbl. Lazy List Comprehension in Logic Programming. Journal of Logic and Computation, 12(5):747-771, 2002.
B. Elbl. A Non-Definability Result for a Predicational Language with the Usual Control. International Journal of Foundations of Computer Science, 12(3):385-396, 2001.
B. Elbl. Cut Elimination for a Calculus with Context-Dependent Rules. Archive for Mathematical Logic., 40(3):167-188, 2001.
B. Elbl. Modeling Meta-Logical Features in a Calculus with Frozen Variables. In: Proof Theory in Computer Science. Dagstuhl seminar. LNCS 2183, Springer 2001, pp.114-129.
B. Elbl. A Declarative Semantics for Depth-First Logic Programs. Journal of Logic Programming, 41(1):27-66, 1999.
R. Berghammer, B. Elbl, U. Schmerl. Formalizing Dijkstra's predicate transformer wp in weak second-order logic. Theoretical Computer Science , 146:185-197, 1995.
Birgit Elbl. Deklarative Semantik für Logikprogramme mit Prologs Auswertungsstrategie. Dissertation UniBw München, 1995.
B. Elbl. Some Notes on the Expressiveness of Predicational Languages. In: Proc. Coll. Programming Languages and Fundamentals of Programming '99, Informatik-Bericht 263 Fernuniversität Hagen, Januar 2000, pp. 9-16.
B. Elbl. Some Applications of Stream Comprehension in Logic Programs. In: R. Berghammer, F. Simon (eds.), Proc. Coll. Programming Languages and Fundamentals of Programming , Report 9717 Uni Kiel, November 1997.
R. Berghammer, B. Elbl, U. Schmerl. Proving total correctness of programs in weak second order logic. In: Proceedings of the REX Workshop Semantics: Foundations and Applications. Beekbergen/Holland 1992. Springer LNCS 666, pp. 51-72.