We show how to extract classical programs expressed in Krivine λc-calculus from proof-terms built in a proof-irrelevant and classical version of the calculus of constructions with...
The Department of Computer Science at California State University, Los Angeles has established an assessment process to guide the continuous improvement of the undergraduate curri...
Russ Abbott, Vladimir Akis, Valentino Crespi, Huip...
A prototype compiler of the ST language (Structured Text), its operation and internal structure is presented. The compiler is a principal part of CPDev engineering environment for ...
A Global Cooperation Project was conducted with computer science classes at the Czech Technical University and North Hennepin Community College. The project was a pilot project fo...
Thomas Macek, Bozena Mannova, Josef Kolar, Barbara...
The universal cover TG of a connected graph G is the unique (possible infinite) tree covering G, i.e., that allows a locally bijective homomorphism from TG to G. Universal covers h...