Skip header Section
Skip Bibliometrics Section
The Craft of ProgrammingAugust 1981
- Author:
- John C. Reynolds
Abstract
No abstract available.
Cited By
- Naumann D Thirty-Seven Years of Relational Hoare Logic: Remarks on Its Principles and History Leveraging Applications of Formal Methods, Verification and Validation: Engineering Principles, (93-116)
- Eriksson J and Parsa M A DSL for Integer Range Reasoning: Partition, Interval and Mapping Diagrams Practical Aspects of Declarative Languages, (196-212)
Antonopoulos T, Gazzillo P, Hicks M, Koskinen E, Terauchi T and Wei S (2017). Decomposition instead of self-composition for proving the absence of timing channels, ACM SIGPLAN Notices, 52:6, (362-375), Online publication date: 14-Sep-2017.- Antonopoulos T, Gazzillo P, Hicks M, Koskinen E, Terauchi T and Wei S Decomposition instead of self-composition for proving the absence of timing channels Proceedings of the 38th ACM SIGPLAN Conference on Programming Language Design and Implementation, (362-375)
- Filliâtre J, Gondelman L and Paskevich A (2016). The spirit of ghost code, Formal Methods in System Design, 48:3, (152-174), Online publication date: 1-Jun-2016.
- Filliâtre J, Gondelman L and Paskevich A The Spirit of Ghost Code Proceedings of the 16th International Conference on Computer Aided Verification - Volume 8559, (1-16)
- BjØrner D and Havelund K 40 Years of Formal Methods Proceedings of the 19th International Symposium on FM 2014: Formal Methods - Volume 8442, (42-61)
- Nanevski A, Banerjee A and Garg D (2013). Dependent Type Theory for Verification of Information Flow and Access Control Policies, ACM Transactions on Programming Languages and Systems, 35:2, (1-41), Online publication date: 1-Jul-2013.
- Banerjee A, Naumann D and Rosenberg S (2013). Local Reasoning for Global Invariants, Part I, Journal of the ACM, 60:3, (1-56), Online publication date: 1-Jun-2013.
- Banerjee A and Naumann D (2013). Local Reasoning for Global Invariants, Part II, Journal of the ACM, 60:3, (1-73), Online publication date: 1-Jun-2013.
- Hatcliff J, Leavens G, Leino K, Müller P and Parkinson M (2012). Behavioral interface specification languages, ACM Computing Surveys, 44:3, (1-58), Online publication date: 1-Jun-2012.
- Hermida C and Tennent R (2012). Monoidal indeterminates and categories of possible worlds, Theoretical Computer Science, 430, (3-22), Online publication date: 1-Apr-2012.
- Harrison W and Hook J (2009). Achieving information flow security through monadic control of effects, Journal of Computer Security, 17:5, (599-653), Online publication date: 1-Oct-2009.
- Hermida C and Tennent R (2009). Monoidal Indeterminates and Categories of Possible Worlds, Electronic Notes in Theoretical Computer Science (ENTCS), 249, (39-60), Online publication date: 1-Aug-2009.
- Torp-Smith N, Birkedal L and Reynolds J (2008). Local reasoning about a copying garbage collector, ACM Transactions on Programming Languages and Systems, 30:4, (1-58), Online publication date: 1-Jul-2008.
- Hofmann M and Pavlova M Elimination of ghost variables in program logics Proceedings of the 3rd conference on Trustworthy global computing, (1-20)
- Cook B, Podelski A and Rybalchenko A Proving thread termination Proceedings of the 28th ACM SIGPLAN Conference on Programming Language Design and Implementation, (320-330)
- Banerjee A, Naumann D and Rosenberg S Towards a logical account of declassification Proceedings of the 2007 workshop on Programming languages and analysis for security, (61-66)
- Cook B, Podelski A and Rybalchenko A (2007). Proving thread termination, ACM SIGPLAN Notices, 42:6, (320-330), Online publication date: 10-Jun-2007.
- Naumann D (2007). On assertion-based encapsulation for object invariants and simulations, Formal Aspects of Computing, 19:2, (205-224), Online publication date: 1-Jun-2007.
- Yang H (2007). Relational separation logic, Theoretical Computer Science, 375:1-3, (308-334), Online publication date: 20-Apr-2007.
- Jones C (2007). Splitting atoms safely, Theoretical Computer Science, 375:1-3, (109-119), Online publication date: 20-Apr-2007.
- Berdine J, Chawdhary A, Cook B, Distefano D and O'Hearn P Variance analyses from invariance analyses Proceedings of the 34th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages, (211-224)
- Berdine J, Chawdhary A, Cook B, Distefano D and O'Hearn P (2007). Variance analyses from invariance analyses, ACM SIGPLAN Notices, 42:1, (211-224), Online publication date: 17-Jan-2007.
- Harrison W Proof abstraction for imperative languages Proceedings of the 4th Asian conference on Programming Languages and Systems, (97-113)
- Banerjee A and Naumann D (2005). Ownership confinement ensures representation independence for object-oriented programs, Journal of the ACM, 52:6, (894-960), Online publication date: 1-Nov-2005.
- Biering B, Birkedal L and Torp-Smith N BI hyperdoctrines and higher-order separation logic Proceedings of the 14th European conference on Programming Languages and Systems, (233-247)
- Ghica D and McCusker G (2003). The regular-language semantics of second-order idealized ALGOL, Theoretical Computer Science, 309:1, (469-502), Online publication date: 2-Dec-2003.
- Back R and Preoteasa V Reasoning about recursive procedures with parameters Proceedings of the 2003 ACM SIGPLAN workshop on Mechanized reasoning about languages with variable binding, (1-7)
- Hannay J Abstraction barrier-observing relational parametricity Proceedings of the 6th international conference on Typed lambda calculi and applications, (135-152)
- Liu Y (2000). Efficiency by Incrementalization, Higher-Order and Symbolic Computation, 13:4, (289-313), Online publication date: 1-Dec-2000.
- Dann W, Cooper S and Pausch R (2000). Making the connection, ACM SIGCSE Bulletin, 32:3, (41-44), Online publication date: 1-Sep-2000.
- Dann W, Cooper S and Pausch R Making the connection Proceedings of the 5th annual SIGCSE/SIGCUE ITiCSEconference on Innovation and technology in computer science education, (41-44)
- Tennent R and Ghica D (2000). Abstract Models of Storage, Higher-Order and Symbolic Computation, 13:1-2, (119-129), Online publication date: 1-Apr-2000.
- Bjørner D and Cuéllar J (1999). Software engineering education, Annals of Software Engineering, 6:1-4, (365-409), Online publication date: 1-Apr-1999.
- Liu Y, Stoller S and Teitelbaum T Discovering auxiliary information for incremental computation Proceedings of the 23rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages, (157-170)
- Willhoft R (1993). Structured APL, ACM SIGAPL APL Quote Quad, 24:1, (304-315), Online publication date: 1-Sep-1993.
- Willhoft R Structured APL Proceedings of the international conference on APL, (304-315)
- Gardiner P and Morgan C (2022). A single complete rule for data refinement, Formal Aspects of Computing, 5:4, (367-382), Online publication date: 1-Jul-1993.
- Janssen W and Zwiers J From sequential layers to distributed processes Proceedings of the eleventh annual ACM symposium on Principles of distributed computing, (215-227)
- Prather R (1992). The semantics of CAT, ACM SIGPLAN Notices, 27:6, (54-63), Online publication date: 1-Jun-1992.
- Wand M and Oliva D Proving the correctness of storage representations Proceedings of the 1992 ACM conference on LISP and functional programming, (151-160)
- Wand M and Oliva D (1992). Proving the correctness of storage representations, ACM SIGPLAN Lisp Pointers, V:1, (151-160), Online publication date: 1-Jan-1992.
- Backhouse R, Chisholm P, Malcolm G and Saaman E (1989). Do-it-yourself type theory, Formal Aspects of Computing, 1:1, (19-84), Online publication date: 1-Mar-1989.
- Gumb R (1989). A first course in program verification and the semantics of programming languages, ACM SIGCSE Bulletin, 21:1, (146-150), Online publication date: 1-Feb-1989.
- Gumb R A first course in program verification and the semantics of programming languages Proceedings of the twentieth SIGCSE technical symposium on Computer science education, (146-150)
- Meyer A and Sieber K Towards fully abstract semantics for local variables Proceedings of the 15th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, (191-203)
- Mills H, Basili V, Gannon J and Hamlet R Teaching principles of computer programming Proceedings of the 15th annual conference on Computer Science, (336-341)
- Lamport L and Schneider F Constraints Proceedings of the 12th ACM SIGACT-SIGPLAN symposium on Principles of programming languages, (205-216)
- Mitchell J and Plotkin G Abstract types have existential types Proceedings of the 12th ACM SIGACT-SIGPLAN symposium on Principles of programming languages, (37-51)
- Halpern J, Meyer A and Trakhtenbrot B The semantics of local storage, or what makes the free-list free?(Preliminary Report) Proceedings of the 11th ACM SIGACT-SIGPLAN symposium on Principles of programming languages, (245-257)
- Mitchell J Coercion and type inference Proceedings of the 11th ACM SIGACT-SIGPLAN symposium on Principles of programming languages, (175-185)
- Szymanski B, Prywes N, Lock E and Pnueli A On the scope of static checking in definitional languages Proceedings of the 1984 annual conference of the ACM on The fifth generation challenge, (197-207)
Index Terms
- The Craft of Programming
Recommendations
Reflections on craft: probing the creative process of everyday knitters
C&C '09: Proceedings of the seventh ACM conference on Creativity and cognitionCrafters today blend age-old techniques such as weaving and pottery with new information and communication technologies such as podcasts, online instructions, and blogs. This intersection of tradition and modernity provides an interesting site for ...
Craft Consciousness: The Powerlessness of Traditional Embroidery
CHI EA '15: Proceedings of the 33rd Annual ACM Conference Extended Abstracts on Human Factors in Computing SystemsOur research aims to comprehend Taiwanese traditional embroidery culture and the traditional embroidery operators' general consciousness about their own jobs through interviews and field research. We learned that there is a sense of "powerlessness" in ...