Open Access. Powered by Scholars. Published by Universities.®

Physical Sciences and Mathematics Commons™

Open Access. Powered by Scholars. Published by Universities.®

Computer science

2015

Series

Articles 1 - 5 of 5

Full-Text Articles in Physical Sciences and Mathematics

A Constraint Language For Static Semantic Analysis Based On Scope Graphs, Hendrik Van Antwerpen, Pierre Néron, Andrew Tolmach, Eelco Visser, Guido Wachsmuth Sep 2015

A Constraint Language For Static Semantic Analysis Based On Scope Graphs, Hendrik Van Antwerpen, Pierre Néron, Andrew Tolmach, Eelco Visser, Guido Wachsmuth

Computer Science Faculty Publications and Presentations

In previous work, we introduced scope graphs as a formalism for describing program binding structure and performing name resolution in an AST-independent way. In this paper, we show how to use scope graphs to build static semantic analyzers. We use constraints extracted from the AST to specify facts about binding, typing, and initialization. We treat name and type resolution as separate building blocks, but our approach can handle language constructs—such as record field access—for which binding and typing are mutually dependent.We also refine and extend our previous scope graph theory to address practical concerns including ambiguity checking and support for …

Go to article

Interview Of Margaret Mccoey, M.S., Margaret M. Mccoey, Matthew Riffe Apr 2015

Interview Of Margaret Mccoey, M.S., Margaret M. Mccoey, Matthew Riffe

All Oral Histories

Margaret “Peggy” McCoey is the Director of Graduate Programs in Computer Information Science, Information Technology, and Economic Crime Forensics at La Salle University. Born in the Oxford Circle section of Philadelphia in 1957, Peggy grew up in St. Martin of Tours parish attending their grade school before going to Little Flower High School. After graduation in 1975, Peggy entered La Salle University an undergraduate where she received a bachelor’s degree in Computer Science. Peggy received a master’s degree from Villanova in 1984. Beginning in 1982, Peggy McCoey has taught at La Salle University in some capacity. Throughout the 1990’s, Peggy …

Go to article

Pedagogical Possibilities For The 2048 Puzzle Game, Todd W. Neller Jan 2015

Pedagogical Possibilities For The 2048 Puzzle Game, Todd W. Neller

Computer Science Faculty Publications

In this paper, we describe an engaging puzzle game called 2048 and outline a variety of exercises that can leverage the game’s popularity to engage student interest, reinforce core CS concepts, and excite student curiosity towards undergraduate research. Exercises range in difficulty from CS1-level exercises suitable for exercising and assessing 1D and 2D array skills to empirical undergraduate research in Monte Carlo Tree Search methods and skilled heuristic evaluation design.

Go to article

A Phenomenological Study Of Computer Science Lecturers: Lived Experiences Of Curriculum Design, Arthur Sloan Jan 2015

A Phenomenological Study Of Computer Science Lecturers: Lived Experiences Of Curriculum Design, Arthur Sloan

Doctoral

This hermeneutic phenomenological study presents a description of computer science lecturers’ experiences of curriculum design of degree programmes during a time of transition in curriculum design policy, specifically in the context of Technological University Dublin (DIT). It examines the lived experiences of computer science lecturers to highlight the issues and problems relating to lecturers’ lived experiences of curriculum design, and it describes how it is to be a computer science lecturer in a time of policy change for curriculum design. The findings are that lecturers have been, and are, struggling to cope with the transition from year-long to semesterised courses, …

Go to article

A Theory Of Name Resolution, Pierre Néron, Andrew Tolmach, Eelco Visser, Guido Wachsmuth Jan 2015

A Theory Of Name Resolution, Pierre Néron, Andrew Tolmach, Eelco Visser, Guido Wachsmuth

Computer Science Faculty Publications and Presentations

We describe a language-independent theory for name binding and resolution, suitable for programming languages with complex scoping rules including both lexical scoping and modules. We formulate name resolution as a two-stage problem. First a language-independent scope graph is constructed using language-specific rules from an abstract syntax tree. Then references in the scope graph are resolved to corresponding declarations using a language-independent resolution process. We introduce a resolution calculus as a concise, declarative, and language- independent specification of name resolution. We develop a resolution algorithm that is sound and complete with respect to the calculus. Based on the resolution calculus we …

Go to article