41 Hits in 4.0 sec

The Extension of ML with Hypothetical Views for Discovery Science: Formalization and Implementation

Eijiro Sumii, Hideo Bannai
2003 Journal of Functional and Logic Programming  
We present VMλ, a formalization and implementation of the functional language VML.  ...  VML is a programming language proposed by discovery scientists for the purpose of assisting the process of knowledge discovery. It is a nontrivial extension of ML with hypothetical views.  ...  Yonezawa's group in University of Tokyo, as well as the anonymous reviewers, for suggestions and encouragements on this work.  ... 
dblp:journals/jflp/SumiiB03 fatcat:fubtu2arxvgzhgqdm24uayspyq

Secure FaaS orchestration in the fog: how far are we?

Alessandro Bocci, Stefano Forti, Gian-Luigi Ferrari, Antonio Brogi
2021 Computing  
Indeed, FaaS providers offer resource auto-provisioning, auto-scaling and pay-per-use billing at no costs for idle time.  ...  AbstractFunction-as-a-Service (FaaS) allows developers to define, orchestrate and run modular event-based pieces of code on virtualised resources, without the burden of managing the underlying infrastructure  ...  Fog computing testbed for research & education", funded by the Department of Computer Science of the University of Pisa, Italy.  ... 
doi:10.1007/s00607-021-00924-y fatcat:k7nlvcrfcncgzfqeb2lnsdjizm

The evolution of Lisp

Guy L. Steele, Richard P. Gabriel
1993 SIGPLAN notices  
their relationships; lambda calculus is the glue of this notation.  ...  The key insight may be explained by analogy to reduction in the lambda calculus.  ... 
doi:10.1145/155360.155373 fatcat:aofyspfp45dgvlmjxqhzwvw34e

Multi-cloud provisioning of business processes

Kyriakos Kritikos, Chrysostomos Zeginis, Joaquin Iranzo, Roman Sosa Gonzalez, Daniel Seybold, Frank Griesinger, Jörg Domaschka
2019 Journal of Cloud Computing: Advances, Systems and Applications  
The Cloud offers enhanced flexibility in the management of resources for any kind of application while it promises the reduction of its cost as well as its infinite scalability.  ...  Such a move is currently performed in a manual manner and only in the context of one Cloud.  ...  Acknowledgements The authors would like to thank the partners of the CloudSocket project ( for their valuable advice and comments.  ... 
doi:10.1186/s13677-019-0143-x fatcat:ptarj3ryfncrreny64oddxv33y

VNS: Namespace Facility

Jim E. Newton
2008 European Lisp Symposium  
Those work-in-progress papers will be discussed at the symposium using a writers' workshop format for giving feedback to the authors in a dedicated session.  ...  Furthermore, we have received seven additional submissions for a work-inprogress track, which describe ongoing work that is not ready for publication yet.  ...  Acknowledgements This work has been supported by the ICT Impulse Programme of the Institute for the encouragement of Scientific Research and Innovation of Brussels (ISRIB), and by the Interuniversity Attraction  ... 
dblp:conf/els/Newton08 fatcat:srwu4fksnnhrtpohd5jx67eeha

The history of Standard ML

David MacQueen, Robert Harper, John Reppy
2020 Proceedings of the ACM on Programming Languages (PACMPL)  
Rod Burstall was introduced to the lambda calculus by Landin and would work for Strachey briefly before moving to Edinburgh in 1965.  ...  ISWIM was basically an applied, call-by-value lambda calculus with syntactic sugar (e.g., łwherež and łletž declaration constructs) for convenience.  ...  variety of typed lambda calculus.  ... 
doi:10.1145/3386336 fatcat:2hrtsaf5azfe3htngsqvxv3kre

The Experiments, as the Irreducible Basis of All Science, and the Observer, as the Measure Space of All Experiments, Are Found Sufficient to Entail All Physics

Alexandre Harvey-Tremblay
A listing of such experiments via a machine or algorithm is recursively enumerable and, if understood as an incremental contribution to knowledge, then serves as a formulation of mathematics that models  ...  While there exist in the wild a process to derive the laws of physics ---namely, the practice of science--- such has not been formalized in mathematics as of yet.  ...  There exists multiple models of computation, such a Turing machines, µ- recursive functions, Lambda calculus, etc.  ... 
doi:10.6084/m9.figshare.11755134.v287 fatcat:azmynbwj3rgyboil7roq2uxgg4

The Physics of the Most Fundamental Object of Nature: A Formal Theory of the Observer

Alexandre Harvey-Tremblay
Here, we propose a theory of the observer sufficiently comprehensive to be suitable for use as the foundation to all physics.  ...  A listing of such experiments is recursively enumerable and as an incremental contribution to knowledge serves as a foundation for the formalization of all falsifiable sciences.  ...  Turing machines, µ- recursive functions, Lambda calculus, etc.  ... 
doi:10.6084/m9.figshare.11755134.v141 fatcat:gruezil37jbchi6r3lgem7y4bm

The Most Fundamental Object in All of Physics: A Formal Theory of The Observer

Alexandre Harvey-Tremblay
A listing of such experiments is recursively enumerable and as a "map" of all knowledge serves as a foundation for the formalization of all science.  ...  Here, we propose a mathematically comprehensive theory of the observer suitable for use as the foundation of theoretical physics.  ...  There exists multiple models of computation, such a Turing machines, µ- recursive functions, Lambda calculus, etc.  ... 
doi:10.6084/m9.figshare.11755134.v138 fatcat:4jbrlmv2nndvzarrv6xzmrusi4

Algorithmic Information Theoretic Issues in Quantum Mechanics [article]

Gavriel Segre
2004 arXiv   pre-print
taking aside the review part, a finite-cardinality's set of new ideas concerning algorithmic information issues in Quantum Mechanics is introduced and analyzed  ...  It is seen that for each m ≥ 1, W m = ∞ n=2 X n , where: X n := x∈Σ n Vm xΣ ∞ (3.3.3) Furthermore, X n ⊂ X n+1 and: P unbaised (X n ) = x∈Σ n Vm P unbaised ( xΣ ∞ ) = x∈Σ n Vm 2 −| x| = cardinality(Σ n  ...  We then discovered that formalizations of the theory of Quantum Formal Systems already existed in the literature: in 1996 Philiph Maymin introduced a quantum analogue of Alonzo Church's Lambda Calculus  ... 
arXiv:quant-ph/0110018v7 fatcat:3a5beei555g4vhgwge7v5ykqee

Systems Biology Markup Language (SBML) Level 2 Version 5: Structures and Facilities for Model Definitions

Michael Hucka, Frank T Bergmann, Andreas Dräger, Stefan Hoops, Sarah M Keating, Nicolas Le Novère, Chris J Myers, Brett G Olivier, Sven Sahle, James C Schaff, Lucian P Smith, Dagmar Waltemath (+1 others)
2015 Journal of Integrative Bioinformatics  
The Systems Biology Markup Language (SBML) is a file format for representing computational models in a declarative form that can be exchanged between different software systems.  ...  By supporting SBML as an input/output format, different tools can all operate on an identical representation of a model, removing opportunities for translation errors and assuring a common starting point  ...  Collaborative Biotechnologies (USA); the Air Force Office of Scientific Research (USA); the California Institute of Technology (USA); the University of Hertfordshire (UK); the Molecular Sciences Institute  ... 
doi:10.2390/biecoll-jib-2015-271 pmid:26528569 pmcid:PMC5457286 fatcat:vx6dfed6xnam3plmtngauwd3ei

Natural Language Processing: A Human-Computer Interaction Perspective [chapter]

Bill Manaris
1998 Advances in Computers  
modality is defined as channel or form for rendering a thought, concept, or action (Coutaz and Caelen, 1991).  ...  It also presents a taxonomy for interactive natural language systems based on their linguistic knowledge and processing requirements, and reviews related applications.  ...  for providing several important references.  ... 
doi:10.1016/s0065-2458(08)60665-8 fatcat:qkvovunv6bdqrn4wwuutmtwd6m

Concurrent programming with actors and microservices

Maximilian Irro, Franz Puntigam
A convenient approach is the concept of concurrent programming. In this thesis, we investigate two different models for introducing concurrent computational units into software architectures.  ...  Microservices facilitate many principles of the old Unix philosophy by composing complex functionality through small, independent, highly cohesive and loosely coupled executables.  ...  Java lambdas are basically functional closures 15 and only allow us to access effectively final fields inside the lambda's scope.  ... 
doi:10.34726/hss.2018.56763 fatcat:gkptcgq4brgplgzaryanmyaizq

Security and Trust in Virtual Environments

A virtualization system's unlimited access to software and data in virtual environments presents a genuine scientific challenge.  ...  The Trusted Computing Module (TPM) as part of a trusted platform can be used to establish trust in a computer and we discuss challenges and present solutions related to establishing trust in a virtual  ...  For this purpose, the lambda calculus is extended with explicit trust operations and a trust-type system.  ... 
doi:10.26180/5ef92f2a30350 fatcat:krwgbk7oiveclmsbugzhw5ieqq

The evolution of Lisp [chapter]

Guy L. Steele, Richard P. Gabriel
History of programming languages---II  
their relationships; lambda calculus is the glue of this notation.  ...  The key insight may be explained by analogy to reduction in the lambda calculus.  ...  Hart in 1963 in a short MIT AI Memo [Hart, 1963] , which we quote here in its entirety [request for permission is pending]: In LISP 1.5 special forms are used for three logically separate purposes: a)  ... 
doi:10.1145/234286.1057818 fatcat:cmc3vyusfvcstfqzfce65k7sxq
« Previous Showing results 1 — 15 out of 41 results