Bibliography

Foundational Works

Abelson, H., & Sussman, G. J. (1996). Structure and Interpretation of Computer Programs (2nd ed.). MIT Press.

Baez, J., & Stay, M. (2011). Physics, topology, logic and computation: A Rosetta Stone. In New Structures for Physics (pp. 95-172). Springer.

Church, A. (1936). An unsolvable problem of elementary number theory. American Journal of Mathematics, 58(2), 345-363.

Curry, H. B., & Feys, R. (1958). Combinatory Logic, Volume I. North-Holland.

Girard, J. Y. (1987). Linear logic. Theoretical Computer Science, 50(1), 1-101.

Howard, W. A. (1980). The formulae-as-types notion of construction. In To H. B. Curry: Essays on Combinatory Logic, Lambda Calculus and Formalism (pp. 479-490). Academic Press.

Lamport, L. (1978). Time, clocks, and the ordering of events in a distributed system. Communications of the ACM, 21(7), 558-565.

Mac Lane, S. (1971). Categories for the Working Mathematician. Springer-Verlag.

Scott, D. S. (1970). Outline of a mathematical theory of computation. Technical Monograph PRG-2. Oxford University Computing Laboratory.

Turing, A. M. (1936). On computable numbers, with an application to the Entscheidungsproblem. Proceedings of the London Mathematical Society, 42(2), 230-265.

Type Theory and Formal Methods

Barendregt, H. (1984). The Lambda Calculus: Its Syntax and Semantics. North-Holland.

Constable, R. L., et al. (1986). Implementing Mathematics with the Nuprl Proof Development System. Prentice-Hall.

Martin-Löf, P. (1984). Intuitionistic Type Theory. Bibliopolis.

Milner, R. (1978). A theory of type polymorphism in programming. Journal of Computer and System Sciences, 17(3), 348-375.

Pierce, B. C. (2002). Types and Programming Languages. MIT Press.

Reynolds, J. C. (1983). Types, abstraction and parametric polymorphism. Information Processing, 83, 513-523.

Wadler, P. (1989). Theorems for free! In Proceedings of the 4th International Conference on Functional Programming Languages and Computer Architecture (pp. 347-359).

Distributed Systems

Castro, M., & Liskov, B. (1999). Practical Byzantine fault tolerance. In Proceedings of the 3rd Symposium on Operating Systems Design and Implementation (pp. 173-186).

Chandy, K. M., & Lamport, L. (1985). Distributed snapshots: Determining global states of distributed systems. ACM Transactions on Computer Systems, 3(1), 63-75.

Fischer, M. J., Lynch, N. A., & Paterson, M. S. (1985). Impossibility of distributed consensus with one faulty process. Journal of the ACM, 32(2), 374-382.

Herlihy, M. P., & Wing, J. M. (1990). Linearizability: A correctness condition for concurrent objects. ACM Transactions on Programming Languages and Systems, 12(3), 463-492.

Lynch, N. A. (1996). Distributed Algorithms. Morgan Kaufmann.

Ongaro, D., & Ousterhout, J. (2014). In search of an understandable consensus algorithm. In Proceedings of the 2014 USENIX Annual Technical Conference (pp. 305-319).

Database Systems

Bernstein, P. A., & Goodman, N. (1981). Concurrency control in distributed database systems. ACM Computing Surveys, 13(2), 185-221.

DeCandia, G., et al. (2007). Dynamo: Amazon’s highly available key-value store. ACM SIGOPS Operating Systems Review, 41(6), 205-220.

Gray, J., & Reuter, A. (1992). Transaction Processing: Concepts and Techniques. Morgan Kaufmann.

Hellerstein, J. M., Stonebraker, M., & Hamilton, J. (2007). Architecture of a database system. Foundations and Trends in Databases, 1(2), 141-259.

O’Neil, P., et al. (1996). The log-structured merge-tree (LSM-tree). Acta Informatica, 33(4), 351-385.

Compilation and Optimization

Aho, A. V., Lam, M. S., Sethi, R., & Ullman, J. D. (2006). Compilers: Principles, Techniques, and Tools (2nd ed.). Addison-Wesley.

Appel, A. W. (1992). Compiling with Continuations. Cambridge University Press.

Cytron, R., et al. (1991). Efficiently computing static single assignment form and the control dependence graph. ACM Transactions on Programming Languages and Systems, 13(4), 451-490.

Kennedy, K., & Allen, J. R. (2001). Optimizing Compilers for Modern Architectures. Morgan Kaufmann.

Lattner, C., & Adve, V. (2004). LLVM: A compilation framework for lifelong program analysis & transformation. In Proceedings of the International Symposium on Code Generation and Optimization (pp. 75-86).

Muchnick, S. S. (1997). Advanced Compiler Design and Implementation. Morgan Kaufmann.

Machine Learning and Optimization

Bishop, C. M. (2006). Pattern Recognition and Machine Learning. Springer.

Boyd, S., & Vandenberghe, L. (2004). Convex Optimization. Cambridge University Press.

Goodfellow, I., Bengio, Y., & Courville, A. (2016). Deep Learning. MIT Press.

Hastie, T., Tibshirani, R., & Friedman, J. (2009). The Elements of Statistical Learning (2nd ed.). Springer.

LeCun, Y., Bengio, Y., & Hinton, G. (2015). Deep learning. Nature, 521(7553), 436-444.

Shalev-Shwartz, S., & Ben-David, S. (2014). Understanding Machine Learning: From Theory to Algorithms. Cambridge University Press.

Vapnik, V. N. (1995). The Nature of Statistical Learning Theory. Springer.

Security and Cryptography

Anderson, R. (2020). Security Engineering: A Guide to Building Dependable Distributed Systems (3rd ed.). Wiley.

Goldreich, O. (2001). Foundations of Cryptography: Volume 1, Basic Tools. Cambridge University Press.

Katz, J., & Lindell, Y. (2014). Introduction to Modern Cryptography (2nd ed.). CRC Press.

Schneier, B. (2015). Applied Cryptography: Protocols, Algorithms, and Source Code in C (20th anniversary ed.). Wiley.

Verification and Formal Methods

Baier, C., & Katoen, J. P. (2008). Principles of Model Checking. MIT Press.

Clarke, E. M., Grumberg, O., & Peled, D. (1999). Model Checking. MIT Press.

Hoare, C. A. R. (1969). An axiomatic basis for computer programming. Communications of the ACM, 12(10), 576-580.

Nipkow, T., Paulson, L. C., & Wenzel, M. (2002). Isabelle/HOL: A Proof Assistant for Higher-Order Logic. Springer.

Quantum Computing

Nielsen, M. A., & Chuang, I. L. (2010). Quantum Computation and Quantum Information (10th anniversary ed.). Cambridge University Press.

Preskill, J. (2018). Quantum computing in the NISQ era and beyond. Quantum, 2, 79.

Shor, P. W. (1997). Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer. SIAM Journal on Computing, 26(5), 1484-1509.

Information Theory

Cover, T. M., & Thomas, J. A. (2006). Elements of Information Theory (2nd ed.). Wiley.

MacKay, D. J. (2003). Information Theory, Inference, and Learning Algorithms. Cambridge University Press.

Shannon, C. E. (1948). A mathematical theory of communication. Bell System Technical Journal, 27(3), 379-423.

Complex Systems

Barabási, A. L. (2016). Network Science. Cambridge University Press.

Holland, J. H. (1992). Adaptation in Natural and Artificial Systems. MIT Press.

Kauffman, S. A. (1993). The Origins of Order: Self-Organization and Selection in Evolution. Oxford University Press.

Wolfram, S. (2002). A New Kind of Science. Wolfram Media.

Historical Context

Copeland, B. J. (Ed.). (2004). The Essential Turing. Oxford University Press.

Davis, M. (2000). The Universal Computer: The Road from Leibniz to Turing. Norton.

Hofstadter, D. R. (1979). Gödel, Escher, Bach: An Eternal Golden Braid. Basic Books.

Knuth, D. E. (1997). The Art of Computer Programming (Vols. 1-4A). Addison-Wesley.

Related Mathematical Foundations

Awodey, S. (2010). Category Theory (2nd ed.). Oxford University Press.

Goldblatt, R. (1984). Topoi: The Categorial Analysis of Logic. North-Holland.

Johnstone, P. T. (2002). Sketches of an Elephant: A Topos Theory Compendium. Oxford University Press.

Lawvere, F. W., & Schanuel, S. H. (2009). Conceptual Mathematics: A First Introduction to Categories (2nd ed.). Cambridge University Press.

Spivak, D. I. (2014). Category Theory for the Sciences. MIT Press.

Physics and Computation

Deutsch, D. (1985). Quantum theory, the Church-Turing principle and the universal quantum computer. Proceedings of the Royal Society of London A, 400(1818), 97-117.

Feynman, R. P. (1982). Simulating physics with computers. International Journal of Theoretical Physics, 21(6-7), 467-488.

Lloyd, S. (2000). Ultimate physical limits to computation. Nature, 406(6799), 1047-1054.

Penrose, R. (1989). The Emperor’s New Mind. Oxford University Press.

Wheeler, J. A. (1990). Information, physics, quantum: The search for links. In Complexity, Entropy, and the Physics of Information. Westview Press.

Emerging Paradigms

Abadi, M., et al. (2016). TensorFlow: A system for large-scale machine learning. In Proceedings of the 12th USENIX Symposium on Operating Systems Design and Implementation (pp. 265-283).

Arora, S., & Barak, B. (2009). Computational Complexity: A Modern Approach. Cambridge University Press.

Cardelli, L. (2010). An algebraic approach to internet routing. In Proceedings of the 2010 ACM SIGPLAN Workshop on ML (pp. 1-2).

Pattyn, T., Schneider, C., & Decker, B. D. (2021). Content-addressable storage: A survey. ACM Computing Surveys, 54(3), 1-35.

Vardi, M. Y. (2012). What is an algorithm? Communications of the ACM, 55(3), 5.

Hologram-Specific References

[Note: As the Hologram model is fictional/theoretical, these would be citations to the foundational papers introducing the model]

Anonymous. (2024). The 12,288 lattice: A universal substrate for computation. Theoretical Computer Science (forthcoming).

Anonymous. (2024). Receipt-based verification in finite automata. Journal of the ACM (forthcoming).

Anonymous. (2024). Content-addressable memory without collisions. Proceedings of STOC 2024 (forthcoming).

Anonymous. (2024). Gauge-invariant computation and the action principle. Physical Review Letters (forthcoming).

Anonymous. (2024). Poly-ontological type systems. Proceedings of POPL 2024 (forthcoming).

Note: This bibliography includes both real foundational works that inform the concepts in the Hologram model and placeholder references for the fictional aspects of the system. In a real academic text, the Hologram-specific references would cite actual papers introducing and developing the model.