4 A First Taste of Desugaring
We’ve begun with a very spartan arithmetic language. Let’s look at how we might extend it with more arithmetic operations that can nevertheless be expressed in terms of existing ones. We’ll add just two, because these will suffice to illustrate the point.
4 A First Taste of Desugaring ▼ Programming Languages: Application and Interpretation 1 Introduction 2 Everything (We Will Say) About Parsing 3 A First Look at Interpretation 4 A First Taste of Desugaring 5 Adding Functions to the Language 6 From Substitution to Environments 7 Functions Anywhere 8 Mutation: Structures and Variables 9 Recursion and Cycles: Procedures and Data 10 Objects 11 Memory Management 12 Representation Decisions 13 Desugaring as a Language Feature 14 Control Operations 15 Checking Program Invariants Statically: Types 16 Checking Program Invariants Dynamically: Contr
Explore this link on the map →saved by
related reading
- Reading 19: Little Languagesweb.mit.edu
- Lambda calculus - Wikipediaen.wikipedia.org
- Structure and Interpretation of Computer Programsmitp-content-server.mit.edu
- Structure and Interpretation of Computer Programsmitp-content-server.mit.edu
- Structure and Interpretation of Computer Programsmitp-content-server.mit.edu
- CSC 151 - Computation via Expressionseikmeier.sites.grinnell.edu
- Palmström: The Lambda Calculus for Absolute Dummies (like myself)palmstroem.blogspot.com
- Leaving Haskell behind - Infinite Negative Utilityjournal.infinitenegativeutility.com
- Beautiful Racket: Make a language in one hour: stackerbeautifulracket.com
- Reading 12: Regular Expressions & Grammarsweb.mit.edu
- Laurence Tratt: Which Parsing Approach?tratt.net
- Representing Code · Crafting Interpreterscraftinginterpreters.com