Structure and interpretation of computer programs
Structure and interpretation of computer programs
Using Prolog to present abstract machines
ACM SIGCSE Bulletin
Teaching recursion using fractals in Prolog
SIGCSE '88 Proceedings of the nineteenth SIGCSE technical symposium on Computer science education
Learning recursion as a concept and as a programming technique
SIGCSE '88 Proceedings of the nineteenth SIGCSE technical symposium on Computer science education
Three “lab assignments” for an algorithms course
ACM SIGCSE Bulletin
Logo as a prelude to LISP: some surprising results
ACM SIGCSE Bulletin
ACM SIGCSE Bulletin
Teaching recursion as a problem-solving tool using standard ML
SIGCSE '89 Proceedings of the twentieth SIGCSE technical symposium on Computer science education
Never mind the language, what about the paradigm?
SIGCSE '89 Proceedings of the twentieth SIGCSE technical symposium on Computer science education
Implementing discrete mathematics: combinatorics and graph theory with Mathematica
Implementing discrete mathematics: combinatorics and graph theory with Mathematica
Communications of the ACM - Special issue: Soviet computing
Implementation of a non-deterministic loop
ACM SIGCSE Bulletin
Fun, rigour and pragmatism in functional programming
ACM SIGCSE Bulletin
C in education and software engineering
ACM SIGCSE Bulletin
Semantics with applications: a formal introduction
Semantics with applications: a formal introduction
Translation—an introductory exercise
ACM SIGCSE Bulletin
Computer science in an undergraduate liberal arts and sciences setting
ACM SIGCSE Bulletin
Introducing functional programming in discrete mathematics
SIGCSE '92 Proceedings of the twenty-third SIGCSE technical symposium on Computer science education
SIGCSE '92 Proceedings of the twenty-third SIGCSE technical symposium on Computer science education
The evolution of the programming languages course
SIGCSE '92 Proceedings of the twenty-third SIGCSE technical symposium on Computer science education
A plan-based approach to Prolog recursion
ACM SIGCSE Bulletin
Teaching tools for data structures and algorithms
ACM SIGCSE Bulletin
SIGCSE '93 Proceedings of the twenty-fourth SIGCSE technical symposium on Computer science education
Data structures: a unified view
ACM SIGCSE Bulletin
Hierarchies of programming concepts: abstraction, generality, and beyond
ACM SIGCSE Bulletin
Discrete mathematics as a precursor to programming
SIGCSE '90 Proceedings of the twenty-first SIGCSE technical symposium on Computer science education
The central role of mathematical logic in computer science
SIGCSE '90 Proceedings of the twenty-first SIGCSE technical symposium on Computer science education
SIGCSE '90 Proceedings of the twenty-first SIGCSE technical symposium on Computer science education
'Programming language paradigms' instruction through designing a new paradigm
Proceedings of the 37th SIGCSE technical symposium on Computer science education
Curriculum development for digital libraries
Proceedings of the 6th ACM/IEEE-CS joint conference on Digital libraries
| Hi-index | 0.00 |
Recent issues of the bulletin of the ACM SIGCSE have been scrutinised to find evidence that the use of laboratory sessions and different programming paradigms improve learning difficult concepts and techniques, such as recursion and problem solving.Many authors in the surveyed literature believe that laboratories are effective because they offer a mode of learning that complements classroom teaching. Several authors believe that different paradigms are effective when used to support teaching mathematics (logic and discrete mathematics) and computer science (programming, comparative programming languages and abstract machines).Precious little evidence by way of reported results of surveys, interviews and exams was found in the ACM SIGCSE bulletins to support these beliefs.