1 resultado para Time step
em Nottingham eTheses
Filtro por publicador
- KUPS-Datenbank - Universität zu Köln - Kölner UniversitätsPublikationsServer (1)
- Aberystwyth University Repository - Reino Unido (1)
- Academic Archive On-line (Stockholm University; Sweden) (1)
- Acceda, el repositorio institucional de la Universidad de Las Palmas de Gran Canaria. España (1)
- AMS Tesi di Dottorato - Alm@DL - Università di Bologna (4)
- AMS Tesi di Laurea - Alm@DL - Università di Bologna (1)
- Aquatic Commons (1)
- ArchiMeD - Elektronische Publikationen der Universität Mainz - Alemanha (4)
- Archive of European Integration (2)
- Archivo Digital para la Docencia y la Investigación - Repositorio Institucional de la Universidad del País Vasco (1)
- Aston University Research Archive (12)
- Biblioteca de Teses e Dissertações da USP (1)
- Biblioteca Digital da Produção Intelectual da Universidade de São Paulo (5)
- Biblioteca Digital da Produção Intelectual da Universidade de São Paulo (BDPI/USP) (13)
- Biblioteca Digital de Teses e Dissertações Eletrônicas da UERJ (4)
- BORIS: Bern Open Repository and Information System - Berna - Suiça (22)
- Boston University Digital Common (2)
- Brock University, Canada (9)
- Bucknell University Digital Commons - Pensilvania - USA (3)
- Bulgarian Digital Mathematics Library at IMI-BAS (1)
- CaltechTHESIS (4)
- Cambridge University Engineering Department Publications Database (21)
- CentAUR: Central Archive University of Reading - UK (40)
- Chinese Academy of Sciences Institutional Repositories Grid Portal (19)
- Cochin University of Science & Technology (CUSAT), India (1)
- CORA - Cork Open Research Archive - University College Cork - Ireland (2)
- Dalarna University College Electronic Archive (1)
- Department of Computer Science E-Repository - King's College London, Strand, London (2)
- Digital Commons - Michigan Tech (9)
- Digital Commons - Montana Tech (1)
- Digital Commons at Florida International University (2)
- Digital Peer Publishing (3)
- DigitalCommons - The University of Maine Research (1)
- DigitalCommons@The Texas Medical Center (2)
- DigitalCommons@University of Nebraska - Lincoln (1)
- DRUM (Digital Repository at the University of Maryland) (2)
- Duke University (2)
- eResearch Archive - Queensland Department of Agriculture; Fisheries and Forestry (2)
- FUNDAJ - Fundação Joaquim Nabuco (1)
- Greenwich Academic Literature Archive - UK (10)
- Indian Institute of Science - Bangalore - Índia (44)
- Institutional Repository of Leibniz University Hannover (2)
- Instituto Politécnico do Porto, Portugal (2)
- Massachusetts Institute of Technology (2)
- Memorial University Research Repository (1)
- National Center for Biotechnology Information - NCBI (5)
- Nottingham eTheses (1)
- Plymouth Marine Science Electronic Archive (PlyMSEA) (1)
- Publishing Network for Geoscientific & Environmental Data (28)
- QSpace: Queen's University - Canada (1)
- QUB Research Portal - Research Directory and Institutional Repository for Queen's University Belfast (29)
- Queensland University of Technology - ePrints Archive (508)
- Repositório Científico da Universidade de Évora - Portugal (1)
- Repositório Científico do Instituto Politécnico de Lisboa - Portugal (1)
- Repositório digital da Fundação Getúlio Vargas - FGV (1)
- Repositório Institucional da Universidade de Aveiro - Portugal (2)
- Repositorio Institucional de la Universidad de Málaga (1)
- Repositório Institucional UNESP - Universidade Estadual Paulista "Julio de Mesquita Filho" (34)
- SAPIENTIA - Universidade do Algarve - Portugal (2)
- Universidad de Alicante (3)
- Universidad Politécnica de Madrid (23)
- Universidade Federal do Rio Grande do Norte (UFRN) (4)
- Universitat de Girona, Spain (2)
- Universitätsbibliothek Kassel, Universität Kassel, Germany (3)
- Université de Lausanne, Switzerland (1)
- Université de Montréal (1)
- Université de Montréal, Canada (4)
- University of Queensland eSpace - Australia (4)
- WestminsterResearch - UK (1)
Resumo:
Starting with an evaluator for a language, an abstract machine for the same language can be mechanically derived using successive program transformations. This has relevance to studying both the space and time properties of programs because these can be estimated by counting transitions of the abstract machine and measuring the size of the additional data structures needed, such as environments and stacks. In this article we use this process to derive a function that accurately counts the number of steps required to evaluate expressions in a simple language.