Filters








352,930 Hits in 5.2 sec

Preschoolers understand and generate pretend actions using object substitution

Simone Bijvoet-van den Berg, Elena Hoicka
2019 Journal of Experimental Child Psychology  
In addition, when the experimenter made her intentions to pretend or try explicit, children produced significantly more novel object substitutions not modeled or verbally requested by the experimenter  ...  However, it found no relationship between children's copying or generation of object substitutions and divergent thinking, inhibitory control, or pretense during free play.  ...  Half of the objects were of indiscriminate shape and function whereas the 10 other half were functionally specific. Figure 2 displays the toys used for each session.  ... 
doi:10.1016/j.jecp.2018.08.008 pmid:30287069 fatcat:xjw4jbvjwfflrhf5lw3kzhbvmm

Functional Programming With Higher-order Abstract Syntax and Explicit Substitutions

Brigitte Pientka
2007 Electronical Notes in Theoretical Computer Science  
This paper sketches a foundation for programming with higher-order abstract syntax and explicit substitutions based on contextual modal type theory [9] .  ...  In this paper, we extend these ideas even further by adding first-class contexts and substitutions so that a program can pass and access code with free variables and an explicit environment, and link them  ...  M ) → e) −→ [[θ]]e Given the current setup, we can prove type safety for our proposed functional language with higher-order abstract syntax and explicit substitutions.  ... 
doi:10.1016/j.entcs.2006.10.037 fatcat:dwyffkssurg7pg6fxkx56vkyh4

Inter-Deriving Semantic Artifacts for Object-Oriented Programming

Olivier Danvy, Jacob Johannsen
2008 BRICS Report Series  
present three new semantic artifacts: a reduction semantics for a version of Abadi and Cardelli's untyped calculus of objects with explicit substitutions, an environment-based abstract machine, and a  ...  We present a new abstract machine for Abadi and Cardelli's untyped calculus of objects.  ...  The first author is grateful to his office mate at PPS, Paul-André Melliès, for insightful discussions and for the description of his completeness proof of the ς-calculus.  ... 
doi:10.7146/brics.v15i5.21940 fatcat:gdzqdp5avrfe7h5br5aycvujsm

Explicit substitutions and higher-order syntax

Neil Ghani, Tarmo Uustalu
2003 Proceedings of the 2003 workshop on Mechanized reasoning about languages with variable binding - MERLIN '03  
Thus explicit substitutions are a natural test case for the further development of the theory and applications of syntax with variable binding.  ...  We derive a similar formula for adding explicit substitutions to the untyped λ-calculus and then show these initial algebras provide useful datatypes for manipulating abstract syntax by implementing two  ...  Acknowledgements We are grateful to our anonymous referees for their useful comments. N. Ghani's research was partially supported by EPSRC under grant No. GR/M96230/01. T.  ... 
doi:10.1145/976571.976580 dblp:conf/icfp/GhaniU03 fatcat:a3wusos4qjfhfp3kq6lxrotgla

Meta-programming with names and necessity

Aleksandar Nanevski
2002 SIGPLAN notices  
This report is a significant revision of and supersedes the version published in April 2002 under the number CMU-CS-02-123  ...  Definition 1 (Explicit substitution, its domain and range) An explicit substitution is a function from the set of names to the set of terms Θ : N → Terms Given a substitution Θ, its domain dom(Θ) is the  ...  For that purpose, we use explicit substitutions. An explicit substitution provides definitions for names which appear at a meta-level in a certain expression.  ... 
doi:10.1145/583852.581498 fatcat:cwgfhmdnxzgx3obxb6j5xcdzbm

Explicit substitutions and higher-order syntax

Neil Ghani, Tarmo Uustalu, Makoto Hamana
2006 Higher-Order and Symbolic Computation  
Thus explicit substitutions are a natural test case for the further development of the theory and applications of syntax with variable binding.  ...  We derive a similar formula for adding explicit substitutions to the untyped λ-calculus and then show these initial algebras provide useful datatypes for manipulating abstract syntax by implementing two  ...  Acknowledgements We are grateful to our anonymous referees for their useful comments. N. Ghani's research was partially supported by EPSRC under grant No. GR/M96230/01. T.  ... 
doi:10.1007/s10990-006-8748-4 fatcat:sqmeqtihp5gj3cwlc2hq6wavay

Meta-programming with names and necessity

Aleksandar Nanevski
2002 Proceedings of the seventh ACM SIGPLAN international conference on Functional programming - ICFP '02  
In addition, we extend our calculus with primitives for inspection and destruction of object programs at run-time in a type-safe manner.  ...  In functional programming, modal types of object programs generally come in two flavors: open and closed, depending on whether the expressions they classify may contain any free variables or not.  ...  Definition 1 (Explicit substitution, its domain and range) An explicit substitution is a function from the set of names to the set of terms Θ : N → Terms Given a substitution Θ, its domain dom(Θ) is  ... 
doi:10.1145/581478.581498 dblp:conf/icfp/Nanevski02 fatcat:hs5wm42bd5hqrn66ntdr4qyrbq

Programming with proofs and explicit contexts

Brigitte Pientka, Jana Dunfield
2008 Proceedings of the 10th international ACM SIGPLAN symposium on Principles and practice of declarative programming - PPDP '08  
In addition, we present an operational semantics for this language based on higher-order pattern matching for dependently typed objects. Based on this development, we prove progress and preservation.  ...  We present a decidable bidirectional type system that distinguishes between dependentlytyped data and computations. To support reasoning about open data, our foundation makes contexts explicit.  ...  We define the contextual substitution operations for normal object, neutral objects and substitutions as follows.  ... 
doi:10.1145/1389449.1389469 dblp:conf/ppdp/PientkaD08 fatcat:oz4q4kbldvcyzjdstkdrsv5bfa

Categorical Models of Explicit Substitutions [chapter]

Neil Ghani, Valeria de Paiva, Eike Ritter
1999 Lecture Notes in Computer Science  
extended with explicit substitutions.  ...  This paper concerns itself with the categorical semantics of -calculi extended with explicit substitutions.  ...  Acknowlegments We w ould like to thank Peter Dybjer, Martin Hofmann, Andrea Schalk and Martin Hyland for discussions on the subject of this paper.  ... 
doi:10.1007/3-540-49019-1_14 fatcat:chgv3wwh3nejbh4ze4bnikcrd4

Inter-deriving Semantic Artifacts for Object-Oriented Programming [chapter]

Olivier Danvy, Jacob Johannsen
2008 Lecture Notes in Computer Science  
We present a new abstract machine for Abadi and Cardelli's untyped calculus of objects.  ...  ., small-step operational semantics) and the natural semantics (i.e., big-step operational semantics) specified in Abadi and Cardelli's monograph.  ...  The first author is grateful to his office mate at PPS, Paul-André Melliès, for insightful discussions and for the description of his completeness proof of the ς-calculus.  ... 
doi:10.1007/978-3-540-69937-8_1 fatcat:foevlsppivd7nndpcgxt6n5zsy

Preface: Theory and Applications of Abstraction, Substitution and Naming

Maribel Fernández, Christian Urban
2011 Journal of automated reasoning  
Formal treatments of abstract syntax have proved harder to develop, especially those addressing properties related to substituting structures for variables, binding of names and fresh name generation.  ...  The first International Workshop on Theory and Applications of Abstraction, Substitution and Naming (TASSN) took place in Edinburgh in 2007, followed by a second workshop in York in 2009, associated to  ...  In the article On Explicit Substitution with Names, Rose, Bloo and Lang describe the origins of the family of calculi of explicit substitution with variable names known as λx, and study the properties  ... 
doi:10.1007/s10817-011-9217-2 fatcat:p7pu4z5be5grng44bmhnsueks4

Project Value-Adding Optimization of Project-Based Supply Chain under Dynamic Reputation Incentives

X. D. Lai, G.-D. Wu, J. G. Shi
2015 International Journal of Simulation Modelling  
the impaction between control objective effect level, bargaining power and project value-adding was detailed analysed, especially the effective equilibrium condition for reputation incentive effects.  ...  Thus compared the analysis conclusions with project-based supply chain incentive model which single considering explicit benefit incentive, and verified the rationality and applicability of the project-based  ...  COMPARISON WITH THE EXPLICIT INCENTIVE MODEL WITHOUT CONSIDERATION OF REPUTATION MECHANISM Description and solution for the explicit incentive model We assume that the output function of the project-based  ... 
doi:10.2507/ijsimm14(1)co1 fatcat:tvnxutjzlvcglmcwmcxhnwxsym

CINNI - A Generic Calculus of Explicit Substitutions and its Application to λ- ς- and π-Calculi

Mark- Oliver Stehr
2000 Electronical Notes in Theoretical Computer Science  
The solution we propose is based on CINNI, a new calculus of explicit substitutions that makes use of a term representation that contains both the standard named notation and de Bruijn's indexed notation  ...  The calculus is parametric in the syntax of the object language, which allows us to apply it to different object languages such as λ-calculus, Abadi and Cardelli's object calculus (ς-calculus) and Milner's  ...  on calculi of explicit substitutions, especially in connection with type theory and proof synthesis, and Narciso Martí-Oliet for many useful suggestions and his constructive criticism.  ... 
doi:10.1016/s1571-0661(05)80125-2 fatcat:ggrxnrgmpnhb5ie6rxdwfw2w5q

Encoding an Object Calculus into Interaction Nets

Fabien Fleutot
2005 Electronical Notes in Theoretical Computer Science  
We propose an encoding of an object calculus into interaction nets in two stages. First, we make the calculus fully explicit, i.e. with explicit substitutions, duplications and erasures.  ...  Then, we use this explicit calculus to produce an interaction net encoding of objects.  ...  Reduction rules β-reduction This is the obvious rule: (λx.e) e R x {e }e (AL) Explicit substitutions We now present the rules for propagating the substitutions created by T and the β-reduction rule  ... 
doi:10.1016/j.entcs.2005.03.024 fatcat:szxs6v3farbmxafxypcmfcgcue

A framework for defining Object-Calculi extended abstract [chapter]

Frédéric Lang, Pierre Lescanne, Luigi Liquori
1999 Lecture Notes in Computer Science  
to provide a generic description of functional language implementations and is based on a calculus of explicit substitution extended with addresses to deal with memory management.  ...  In this paper, we give a general framework for the foundation of an operational (small step) semantics of object-based languages with an emphasis on functional and imperative issues.  ...  The authors are grateful to Zine-El-Abidine Benaissa, Furio Honsell, and Kristoffer Høgsbro Rose for their useful comments on this work.  ... 
doi:10.1007/3-540-48118-4_2 fatcat:4zpj5crq5fcavikxm6zv36lzwy
« Previous Showing results 1 — 15 out of 352,930 results