Péter Szeredi
Department of Computer Science and Information Theory, Budapest University of Technology and Economics, Hungary
Download articlePublished in: Proceedings of the First International Workshop on Teaching Logic Programming: TeachLP 2004
Linköping Electronic Conference Proceedings 12:5, p. 55-70
Published: 2004-10-04
ISBN:
ISSN: 1650-3686 (print), 1650-3740 (online)
The paper describes courses related to Logic Programming at the Budapest University of Technology and Economics. We present the layout and the contents of the main such course; entitled Declarative Programming; as well as the tools used in teaching this subject. We then give a brief outline of the elective courses and other educational activities in the subject area.
[1] Andrés György B´ek´es and Lukács Tamás Berki. A Web-based student exercising system for teaching programming languages (in Hungarian); 2001. Students’ Conference; BUTE; Budapest; Hungary.
[2] Dávid Hanák. Computer support for declarative programming courses (in Hungarian); 2001. MSc Thesis; BUTE; Budapest; Hungary.
[3] Dávid Hanák; Tamás Benkö; Péter Hanák; and Péter Szeredi. Computer aided exercising in Prolog and SML. In Proceedings of the Workshop on Functional and Declarative Programming in Education; PLI 2002; Pittsburgh PA; USA; October 2002.
[4] Dávid Hanák and Tamás Szeredi. FDBG; the CLP(FD) debugger library of SICStus Prolog. In SusanaMu˜noz Hern´andez and Jos´e Manuel G´omez-P´erez; editors; Proceedings of the Fourteenth International Workshop on Logic Programming Environments (WLPE’04); Saint-Malo; France; September 2004.
[5] Manuel Hermenegildo. Slide presentations using latex/xdvi; 2003. CLIP Group; School of Computer Science; Technical University of Madrid; http://clip.dia.fi.upm.es/Software/xdvipresent html.
[6] Gergely Lukácsy. Comparison of source program structures (in Hungarian); 2001. National Students’ Conference; Eger; Hungary.
[7] Tamás Nepusz. Visualisation of Prolog program execution (in Hungarian); 2003. Students’ Conference; BUTE; Budapest; Hungary.
[8] Ulf Nilsson and Jan Maluszynski. Logic; Programming and Prolog (2nd ed). John Wiley; 1995.
[9] SICS; Swedish Institute of Computer Science. SICStus Prolog Manual; 3.11; June 2004.
[10] Zoltan Somogyi; Fergus Henderson; and Thomas Conway. The execution algorithm of Mercury: an efficient purely declarative logic programming language. Journal of Logic Programming; 29(1-3):17–64; 1996.
[11] Péter Szeredi. Teaching constraints through logic puzzles. In Krzysztof R. Apt et al.; editor; Recent Advances in Constraints; Joint ERCIM/CoLogNET International Workshop on Constraint Solving and Constraint Logic Programming; CSCLP 2003; Selected Papers; volume 3010 of Lecture Notes in Computer Science; pages 196–222. Springer; 2004.
[12] Péter Szeredi and Tamás Benkö. Introduction to logic programming (in Hungarian). Budapest University of Technology and Economics; Faculty of Electrical Engineering and Informatics; 1998; 2001; 2004. Study-aid for the Declarative Programming course. Manuscript.
[13] David H. D. Warren. Logic programming and compiler writing. Software Practice and Experience; 10:97–125; 1980.
Citations in Crossref