|
- Lambda calculus - Lambda Calculus - Stanford University
one-line universal program: Here’s a lambda calculus self-interpreter: \( (\lambda f (\lambda x f(xx))(\lambda x f(xx)))(\lambda em m(\lambda x x)(\lambda mn em(en))(\lambda mv e(mv))) \) In contrast, universal Turing machines are so tedious that classes often skip the details and just explain why they exist
- The Art of The Interpreter Or, The Modularity Complex
At each step we exhibit an interactive meta-circular interpreter for the language under consideration Each new interpreter is the result of an incremental change to a previous interpreter We explore the consequences of various variable binding disciplines and the introduction of side effects
- File Structure : Broad Institute of MIT and Harvard
Knowing where files are, when to use certain code for certain operations, and how to find associated results, data, and figures can not only streamline productivity, but also allow for consistency (even across multiple projects) and shareability
- Eric Walkingshaw - Modular Extensibility
Understand the specific concept of modular extensibility, how it can be achieved, and its significance in language design and software engineering Develop some working definitions of more general concepts like modularity and expressiveness that arise in discussions about languages and software
- Introduction to Modularity and Interfaces In System Design
In software design, modularity means breaking down big problems into smaller, more manageable parts Interfaces are like bridges that connect these parts together This article explains how using modularity and clear interfaces makes it easier to build and maintain software, with tips for making systems more flexible and easy to understand
|
|
|