Диссертация (1150902), страница 18
Текст из файла (страница 18)
Abramsky, S. Game semantics / S. Abramsky, G. McCusker // In ComputationalLogic: Proceedings of the 1997 Marktoberdorf Summer School. — Springer,1999. — P. 1–56.42. Ker, A. D. Innocent game models of untyped lambda-calculus / A. D. Ker,H. Nickau, C.-H. L. Ong // Theor. Comput. Sci. — 2002. — Vol.
272, no. 12. — P. 247–292.43. Ker, A. D. A Universal Innocent Game Model for the Böhm Tree Lambda Theory / A. D. Ker, H. Nickau, C.-H. L. Ong // Lecture Notes in Computer Science,Computer Science Logic, 13th International Workshop, CSL ’99, 8th Annual Conference of the EACSL, Madrid, Spain, September 20-25, 1999, Proceedings / Ed.by J.
Flum, M. Rodríguez-Artalejo. — Vol. 1683. — Springer, 1999. — P. 405–419.44. Blum, W. A concrete presentation of game semantics / W. Blum, C.-H. L. Ong //In Galop 2008:Games for Logic and Programming Languages. — 2008.45. Ghica, D. R. The regular-language semantics of second-order idealized ALGOL /D. R. Ghica, G. McCusker // Theor. Comput. Sci. — 2003. — Vol. 309, no. 1-3.— P.
469–502.46. Ghica, D. R. Semantical Analysis of Specification Logic, 3: An Operational Approach / D. R. Ghica // Lecture Notes in Computer Science, Programming Languages and Systems, 13th European Symposium on Programming, ESOP 2004,103Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2004, Barcelona, Spain, March 29 - April 2, 2004, Proceedings /Ed. by D. A.
Schmidt. — Vol. 2986. — Springer, 2004. — P. 264–278.47. Ghica, D. R. A System-Level Game Semantics / D. R. Ghica, N. Tzevelekos //Electr. Notes Theor. Comput. Sci. — 2012. — Vol. 286. — P. 191–211.48. Ghica, D. R. Applications of Game Semantics: From Program Analysis to Hardware Synthesis / D. R. Ghica // Proceedings of the 24th Annual IEEE Symposiumon Logic in Computer Science, LICS 2009, 11-14 August 2009, Los Angeles, CA,USA. — IEEE Computer Society, 2009.
— P. 17–26.49. Gabbay, M. Game Semantics in the Nominal Model / M. Gabbay, D. R. Ghica //Electr. Notes Theor. Comput. Sci. — 2012. — Vol. 286. — P. 173–189.50. Blum, W. The Safe Lambda Calculus / W. Blum, C.-H. L. Ong // Lecture Notesin Computer Science, Typed Lambda Calculi and Applications, 8th InternationalConference, TLCA 2007, Paris, France, June 26-28, 2007, Proceedings / Ed.
byS. R. D. Rocca. — Vol. 4583. — Springer, 2007. — P. 39–53.51. Danos, V. Directed Virtual Reductions / V. Danos, M. Pedicini, L. Regnier //Lecture Notes in Computer Science, Computer Science Logic, 10th InternationalWorkshop, CSL ’96, Annual Conference of the EACSL, Utrecht, The Netherlands, September 21-27, 1996, Selected Papers / Ed.
by D. van Dalen, M. Bezem.— Vol. 1258. — Springer, 1996. — P. 76–88.52. Blum, W. The Safe Lambda Calculus / W. Blum, C.-H. L. Ong // Logical Methodsin Computer Science. — 2009. — Vol. 5, no. 1.53. Barendregt, H. P. Lambda Calculus with Types / H. P. Barendregt, W. Dekkers,R. Statman. Perspectives in logic. — Cambridge University Press, 2013.54.
Barendregt, H. Self-Interpretations in lambda Calculus / H. Barendregt // J. Funct.Program. — 1991. — Vol. 1, no. 2. — P. 229–233.55. Barendregt, H. P. Functional Programming and Lambda Calculus / H. P. Barendregt // Handbook of Theoretical Computer Science, Volume B: Formal Modelsand Sematics (B). — 1990. — P. 321–363.10456. Barendregt, H.
Types in Lambda Calculi and Programming Languages / H. Barendregt, K. Hemerik // Lecture Notes in Computer Science, ESOP’90, 3rd EuropeanSymposium on Programming, Copenhagen, Denmark, May 15-18, 1990, Proceedings / Ed. by N. D. Jones. — Vol. 432. — Springer, 1990. — P.
1–35.57. Keller, R. M. Formal Verification of Parallel Programs / R. M. Keller // Commun.ACM. — 1976. — Vol. 19, no. 7. — P. 371–384.58. Cabodi, G. Computing Timed Transition Relations for Sequential Cycle-BasedSimulation / G. Cabodi, P. Camurati, C. Passerone, S. Quer // 1999 Design, Automation and Test in Europe (DATE ’99), 9-12 March 1999, Munich, Germany.— IEEE Computer Society / ACM, 1999.
— P. 8–12.59. Reynolds, J. C. Definitional Interpreters for Higher-Order Programming Languages / J. C. Reynolds // Higher-Order and Symbolic Computation. — 1998.— Vol. 11, no. 4. — P. 363–397.60. Reynolds, J C. Definitional Interpreters Revisited / J C. Reynolds // Higher-Orderand Symbolic Computation. — 1998.
— Vol. 11, no. 4. — P. 355–361.61. Reynolds, J. C. The design, definition and implementation of programming languages / J. C. Reynolds // ACM SIGSOFT Software Engineering Notes. — 2000.— Vol. 25, no. 1. — P. 75.62. Haskell language documentation [Электронный ресурс]. — URL: https://www.haskell.org/documentation (дата обращения: 03.12.2017).63. Racket language documentation [Электронный ресурс]. — URL: https://docs.racket-lang.org/ (дата обращения: 03.12.2017).64. Romanenko, S.
A. A compiler generator produced by a self-applicable specializercan have a suprisingly natural and understandable structure / S. A. Romanenko //A.P. Ershov, D. Bjorner and N.D. Jones, editors, Partial Evaluation and MixedComputation. — 1988. — P. 445–463.65. Partial Evaluation - Practice and Theory, DIKU 1998 International SummerSchool, Copenhagen, Denmark, June 29 - July 10, 1998 / Ed. by J. Hatcliff,T. Æ. Mogensen, P. Thiemann.
— Vol. 1706, Springer, 1999.10566. Proceedings of the 2009 ACM SIGPLAN Symposium on Partial Evaluation andSemantics-based Program Manipulation, PEPM 2009, Savannah, GA, USA, January 19-20, 2009 / Ed. by G. Puebla, G. Vidal. — ACM, 2009.67. Futamura, Y. Partial evaluation of computation process – an approach to acompiler-compiler / Y. Futamura // Systems, Computers, Controls. — 1971. —Vol. 2(5).
— P. 45–50.68. Jones, N. D. Partial evaluation and automatic program generation / N. D. Jones,C. K. Gomard, P. Sestoft. Prentice Hall international series in computer science.— Prentice Hall, 1993.69. Futamura, Y. Partial Evaluation of Computation Process - An Approach to aCompiler-Compiler / Y.
Futamura // Higher-Order and Symbolic Computation.— 1999. — Vol. 12, no. 4. — P. 381–391.70. Kahn, K. M. Partial Evaluation, Programming Methodology, and Artificial Intelligence / K. M. Kahn // AI Magazine. — 1984. — Vol. 5, no. 1. — P. 53–57.71. Jones, N. D. An Experiment in Partial Evaluation: The Generation of a CompilerGenerator / N.
D. Jones, P. Sestoft, H. Søndergaard // Lecture Notes in ComputerScience, Rewriting Techniques and Applications, First International Conference,RTA-85, Dijon, France, May 20-22, 1985, Proceedings / Ed. by J.-P. Jouannaud.— Vol. 202. — Springer, 1985. — P. 124–140.72. Mahr, B. Term Evaluation in Partial Algebras / B. Mahr // ADT. — 1986.73. Berezun, D. Compiling untyped lambda calculus to lower-level code by gamesemantics and partial evaluation (invited paper) / D.
Berezun, N. D. Jones // Proceedings of the 2017 ACM SIGPLAN Workshop on Partial Evaluation and Program Manipulation, PEPM 2017, Paris, France, January 18-20, 2017 / Ed. byU. P. Schultz, J. Yallop. — ACM, 2017. — P. 1–11.74. Schmidt, D. A.
State transition machines for lambda calculus expressions /D. A. Schmidt // Lecture Notes in Computer Science, Semantics-Directed Compiler Generation, Proceedings of a Workshop, Aarhus, Denmark, January 14-18,1980 / Ed. by N. D. Jones. — Vol. 94. — Springer, 1980. — P. 415–440.10675. Semantics-Directed Compiler Generation, Proceedings of a Workshop, Aarhus,Denmark, January 14-18, 1980 / Ed. by N. D. Jones. — Vol.
94, Springer, 1980.76. Diehl, S. Natural Semantics-Directed Generation of Compilers and Abstract Machines / S. Diehl // Formal Asp. Comput. — 2000. — Vol. 12, no. 2. — P. 71–99.77. Diehl, S. Semantics-directed generation of compilers and abstract machines /S. Diehl // Ph.D. thesis, Saarland University, Saarbrücken, Germany. — 1996.78. Hannan, J. Operational Semantics-Directed Compilers and Machine Architectures / J. Hannan // ACM Trans. Program.
Lang. Syst. — 1994. — Vol. 16,no. 4. — P. 1215–1247.79. Paulson, L. C. A Semantics-Directed Compiler Generator / L. C. Paulson // Conference Record of the Ninth Annual ACM Symposium on Principles of Programming Languages, Albuquerque, New Mexico, USA, January 1982 / Ed. byR. A. DeMillo.
— ACM Press, 1982. — P. 224–233.80. Berezun, D. Precise Garbage Collection for C++ with a Non-cooperative Compiler / D. Berezun, D. Boulytchev // CEE-SECR ’14, Proceedings of the 10thCentral and Eastern European Software Engineering Conference in Russia. —CEE-SECR ’14. — New York, NY, USA: ACM, 2014. — P. 15:1–15:8.81. de Bruijn, N. G. Lambda Calculus Notation with Nameless Dummies: A Tool forAutomatic Formula Manipulation, with Application to the Church-Rosser Theorem / N. G.
de Bruijn // Indagationes Mathematicae, Elsevier. — 1972. — P. 34:381–392.82. Kamareddine, F. Bridging Curry and Church’s typing style / F. Kamareddine,J. P. Seldin, J. B. Wells // J. Applied Logic. — 2016. — Vol. 18. — P. 42–70.83. Pierce, B. C. Types and programming languages / B. C. Pierce. — MIT Press,2002.84. Liquori, L. Intersection-types à la Church / L.
Liquori, S. R. D. Rocca // Inf. Comput. — 2007. — Vol. 205, no. 9. — P. 1371–1386.10785. Farmer, W. M. A Partial Functions Version of Church’s Simple Theory of Types /W. M. Farmer // J. Symb. Log. — 1990. — Vol. 55, no. 3. — P. 1269–1291.86. Sestoft, P. Demonstrating Lambda Calculus Reduction / P. Sestoft // Lecture Notesin Computer Science, The Essence of Computation, Complexity, Analysis, Transformation.
Essays Dedicated to Neil D. Jones [on occasion of his 60th birthday] /Ed. by T. Æ. Mogensen, D. A. Schmidt, I. H. Sudborough. — Vol. 2566. —Springer, 2002. — P. 420–435.87. Huet, G. P. Regular Böhm trees / G. P. Huet // Mathematical Structures in Computer Science. — 1998.
— Vol. 8, no. 6. — P. 671–680.88. Wadsworth, C. P. Semantics and Pragmatics of the Lambda-Calculus /C. P. Wadsworth // Ph.D. thesis, University of Oxford, UK. — 1971.89. Sinot, F.-R. Complete Laziness: a Natural Semantics / F.-R. Sinot // Electr. NotesTheor. Comput. Sci. — 2008. — Vol. 204. — P.
![](https://s.studizba.com/z.php?f=/templates/si/i/noavatar.png&w=100&h=100&t=1"){kind=avatar}
