| |
| 2002 | ||
|---|---|---|
| 8 | EE | Birgit Elbl: Lazy List Comprehension in Logic Programming. J. Log. Comput. 12(5): 747-771 (2002) |
| 2001 | ||
| 7 | EE | Birgit Elbl: Modeling Meta-logical Features in a Calculus with Frozen Variables. Proof Theory in Computer Science 2001: 114-129 |
| 6 | EE | Birgit Elbl: Cut elimination for a calculus with context-dependent rules. Arch. Math. Log. 40(3): 167-188 (2001) |
| 5 | Birgit Elbl: A Non-Definability Result for a Predicational Language with the Usual Control. Int. J. Found. Comput. Sci. 12(3): 385-396 (2001) | |
| 2000 | ||
| 4 | EE | Birgit Elbl: Justifying control for logic programs. Electr. Notes Theor. Comput. Sci. 35: (2000) |
| 1999 | ||
| 3 | Birgit Elbl: A Declarative Semantics for Depth-First Logic Programs. J. Log. Program. 41(1): 27-66 (1999) | |
| 1995 | ||
| 2 | EE | Rudolf Berghammer, Birgit Elbl, Ulf R. Schmerl: Formalizing Dijkstra's Predicate Transformer wp in Weak Second-Order Logic. Theor. Comput. Sci. 146(1&2): 185-197 (1995) |
| 1992 | ||
| 1 | Rudolf Berghammer, Birgit Elbl, Ulf R. Schmerl: Proving Total Correctness of Programs in Weak Second-Order Logic. REX Workshop 1992: 51-72 | |
| 1 | Rudolf Berghammer | [1] [2] |
| 2 | Ulf R. Schmerl | [1] [2] |