Open Access. Powered by Scholars. Published by Universities.®
Programming Languages and Compilers Commons™
Open Access. Powered by Scholars. Published by Universities.®
- Discipline
- Keyword
- Publication
Articles 1 - 6 of 6
Full-Text Articles in Programming Languages and Compilers
Personalizing Software Development Practice Using Mastery-Based Coaching, Chris Boesch, Sandra Boesch
Personalizing Software Development Practice Using Mastery-Based Coaching, Chris Boesch, Sandra Boesch
Chris BOESCH
The authors previously developed a system to facilitate the self-directed learning and practicing of software languages in Singapore. One of the goals of this self-directed learning was to enable the development of student mentors who would then be able to assist other students during classroom sessions. Building on this work, the authors extended the platform to support personalized coaching with the goals of further enabling and preparing students to mentor their peers. This paper covers the challenges, insights, and features that were developed in order to develop and deploy this mastery-based coaching feature.
A Static Cost Analysis For A Higher-Order Language, Norman Danner, Jennifer Paykin, James Royer
A Static Cost Analysis For A Higher-Order Language, Norman Danner, Jennifer Paykin, James Royer
Norman Danner
We develop a static complexity analysis for a higher-order functional language with structural list recursion. The complexity of an expression is a pair consisting of a cost and a potential. The former is defined to be the size of the expression's evaluation derivation in a standard big-step operational semantics. The latter is a measure of the "future" cost of using the value of that expression. A translation function ||.|| maps target expressions to complexities. Our main result is the following Soundness Theorem: If t is a term in the target language, then the cost component of ||t|| is an upper …
Two Algorithms In Search Of A Type System, Norman Danner, James Royer
Two Algorithms In Search Of A Type System, Norman Danner, James Royer
Norman Danner
The authors’ ATR programming formalism is a version of call-by-value PCF under a complexity-theoretically motivated type system. ATR programs run in type-2 polynomial-time and all standard type-2 basic feasible functionals are ATR -definable ( ATR types are confined to levels 0, 1, and 2). A limitation of the original version of ATR is that the only directly expressible recursions are tail-recursions. Here we extend ATR so that a broad range of affine recursions are directly expressible. In particular, the revised ATR can fairly naturally express the classic insertion- and selection-sort algorithms, thus overcoming a sticking point of most prior implicit-complexity-based …
A Parameterized Stereo Vision Core For Fpgas, Mark Chang, Stephen Longfield
A Parameterized Stereo Vision Core For Fpgas, Mark Chang, Stephen Longfield
Mark L. Chang
We present a parameterized stereo vision core suitable for a wide range of FPGA targets and stereo vision applications. By enabling easy tuning of algorithm parameters, our system allows for rapid exploration of the design space and simpler implementation of high-performance stereo vision systems. This implementation utilizes the census transform algorithm to calculate depth information from a pair of images delivered from a simulated stereo camera pair. This work advances our previous work through implementation improvements, a stereo camera pair simulation framework, and a scalable stereo vision core.
Precis: A Usercentric Word-Length Optimization Tool, Mark Chang, Scott Hauck
Precis: A Usercentric Word-Length Optimization Tool, Mark Chang, Scott Hauck
Mark L. Chang
Translating an algorithm designed for a general-purpose processor into an algorithm optimized for custom logic requires extensive knowledge of the algorithm and the target hardware. Precis lets designers analyze the precision requirements of algorithms specified in Matlab. The design time tool combines simulation, user input, and program analysis to help designers focus their manual precision optimization efforts.
Ramified Structural Recursion And Corecursion, Norman Danner, James Royer
Ramified Structural Recursion And Corecursion, Norman Danner, James Royer
Norman Danner
We investigate feasible computation over a fairly general notion of data and codata. Specifically, we present a direct Bellantoni-Cook-style normal/safe typed programming formalism, RS1, that expresses feasible structural recursions and corecursions over data and codata specified by polynomial functors. (Lists, streams, finite trees, infinite trees, etc. are all directly definable.) A novel aspect of RS1 is that it embraces structure-sharing as in standard functional-programming implementations. As our data representations use sharing, our implementation of structural recursions are memoized to avoid the possibly exponentially-many repeated subcomputations a naive implementation might perform. We introduce notions of size for representations of data (accounting …