{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:34:22Z","timestamp":1742913262586,"version":"3.40.3"},"publisher-location":"Cham","reference-count":19,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031199066"},{"type":"electronic","value":"9783031199073"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023]]},"DOI":"10.1007\/978-3-031-19907-3_42","type":"book-chapter","created":{"date-parts":[[2023,1,13]],"date-time":"2023-01-13T06:07:32Z","timestamp":1673590052000},"page":"434-451","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A Meta-Probabilistic-Programming Language for\u00a0Bisimulation of\u00a0Probabilistic and\u00a0Non-Well-Founded Type Systems"],"prefix":"10.1007","author":[{"given":"Jonathan","family":"Warrell","sequence":"first","affiliation":[]},{"given":"Alexey","family":"Potapov","sequence":"additional","affiliation":[]},{"given":"Adam","family":"Vandervorst","sequence":"additional","affiliation":[]},{"given":"Ben","family":"Goertzel","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,1,14]]},"reference":[{"unstructured":"Baier, C., Katoen, J.P.: Principles of Model Checking. MIT press (2008)","key":"42_CR1"},{"key":"42_CR2","first-page":"239","volume":"34","author":"H Barendregt","year":"1992","unstructured":"Barendregt, H., Augustsson, L.: Lambda calculi with types. Handb. Log. Comput. Sci. 34, 239\u2013250 (1992)","journal-title":"Handb. Log. Comput. Sci."},{"unstructured":"Barwise, J., Moss, L.: Vicious circles: on the mathematics of non-wellfounded phenomena (1996)","key":"42_CR3"},{"unstructured":"Birkedal, L., Bizjak, A., Clouston, R., Grathwohl, H.B., Spitters, B., Vezzosi, A.: Guarded cubical type theory: path equality for guarded recursion. arXiv preprint arXiv:1606.05223 (2016)","key":"42_CR4"},{"doi-asserted-by":"crossref","unstructured":"Goertzel, B.: Modeling uncertain self-referential semantics with infinite-order probabilities (2008)","key":"42_CR5","DOI":"10.1007\/978-0-387-76872-4_3"},{"unstructured":"Goertzel, B.: Folding and unfolding on metagraphs. arXiv preprint arXiv:2012.01759 (2020)","key":"42_CR6"},{"unstructured":"Goertzel, B.: Paraconsistent foundations for probabilistic reasoning, programming and concept formation. arXiv preprint arXiv:2012.14474 (2020)","key":"42_CR7"},{"unstructured":"Goertzel, B.: Reflective metagraph rewriting as a foundation for an AGI \u2018language of thought\u2019. arXiv preprint arXiv:2112.08272 (2021)","key":"42_CR8"},{"unstructured":"Harper, R.: Notes on logical frameworks. Lect. Notes, Insts. Adv. Study Nov 29, 34 (2012)","key":"42_CR9"},{"issue":"POPL","key":"42_CR10","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3290317","volume":"3","author":"RE M\u00f8gelberg","year":"2019","unstructured":"M\u00f8gelberg, R.E., Veltri, N.: Bisimulation as path type for guarded recursive types. Proc. ACM on Program. Lang. 3(POPL), 1\u201329 (2019)","journal-title":"Proc. ACM on Program. Lang."},{"issue":"3","key":"42_CR11","doi-asserted-by":"publisher","first-page":"465","DOI":"10.1017\/S0960129518000087","volume":"29","author":"RE M\u00f8gelberg","year":"2019","unstructured":"M\u00f8gelberg, R.E., Paviotti, M.: Denotational semantics of recursive types in synthetic guarded domain theory. Math. Struct. Comput. Sci. 29(3), 465\u2013510 (2019)","journal-title":"Math. Struct. Comput. Sci."},{"issue":"10","key":"42_CR12","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1145\/3156695.3122956","volume":"52","author":"A Mokhov","year":"2017","unstructured":"Mokhov, A.: Algebraic graphs with class (functional pearl). ACM SIGPLAN Not. 52(10), 2\u201313 (2017)","journal-title":"ACM SIGPLAN Not."},{"key":"42_CR13","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1016\/j.entcs.2015.12.020","volume":"319","author":"M Paviotti","year":"2015","unstructured":"Paviotti, M., M\u00f8gelberg, R.E., Birkedal, L.: A model of PCF in guarded type theory. Electron. Notes Theor. Comput. Sci. 319, 333\u2013349 (2015)","journal-title":"Electron. Notes Theor. Comput. Sci."},{"unstructured":"Potapov, A.: MeTTa language specification (2021). https:\/\/wiki.opencog.org\/w\/Hyperon","key":"42_CR14"},{"doi-asserted-by":"crossref","unstructured":"Staton, S., Wood, F., Yang, H., Heunen, C., Kammar, O.: Semantics for probabilistic programming: higher-order functions, continuous distributions, and soft constraints. In: 2016 31st Annual ACM\/IEEE Symposium on Logic in Computer Science (LICS), pp. 1\u201310 (2016)","key":"42_CR15","DOI":"10.1145\/2933575.2935313"},{"unstructured":"TrueAGI. Hyperon-experimental repository (2021). https:\/\/github.com\/trueagi-io\/hyperon-experimental","key":"42_CR16"},{"doi-asserted-by":"crossref","unstructured":"Veltri, N., Vezzosi, A.: Formalizing $$\\pi $$-calculus in guarded cubical Agda. In: Proceedings of the 9th ACM SIGPLAN International Conference on Certified Programs and Proofs, pp. 270\u2013283 (2020)","key":"42_CR17","DOI":"10.1145\/3372885.3373814"},{"key":"42_CR18","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1017\/S0956796821000034","volume":"31","author":"A Vezzosi","year":"2021","unstructured":"Vezzosi, A., M\u00f6rtberg, A., Abel, A.: Cubical Agda: a dependently typed programming language with univalence and higher inductive types. J. Funct. Program. 31, 1\u201329 (2021)","journal-title":"J. Funct. Program."},{"unstructured":"Warrell, J., Gerstein, M.: Dependent type networks: a probabilistic logic via the curry-howard correspondence in a system of probabilistic dependent types. In: Uncertainty in Artificial Intelligence, Workshop on Uncertainty in Deep Learning (2018). http:\/\/www.gatsby.ucl.ac.uk\/~balaji\/udl-camera-ready\/UDL-19.pdf","key":"42_CR19"}],"container-title":["Lecture Notes in Computer Science","Artificial General Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-19907-3_42","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,13]],"date-time":"2023-01-13T07:09:08Z","timestamp":1673593748000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-19907-3_42"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031199066","9783031199073"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-19907-3_42","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"14 January 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"AGI","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Artificial General Intelligence","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Seattle, WA","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 August 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 August 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"agi2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/agi-conf.org\/2022\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"61","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"31","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"51% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2,54","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3,6","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"13 additional posters were included","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}