Filters








1,179 Hits in 6.5 sec

Design, analysis and Reasoning about Tools: Abstracts from the Second Workshop (Aalborg, 1992, 20-21 August)

Flemming Nielson
1992 DAIMI Report Series  
This report contains a brief overview of DART as well as abstracts of the 20 talks given at the workshop and a status report of DART as of summer 1992.  ...  The primary aim of the workshop was to increase the awareness of DART participants for each other's work, and to stimulate cooperation between the various groups.  ...  lambda-calculus.  ... 
doi:10.7146/dpb.v21i417.6730 fatcat:pwvpx7dapfffhpzvtcy7nkl7sq

PhD Abstracts

GRAHAM HUTTON
2015 Journal of functional programming  
Many students complete PhDs in functional programming each year, but there is currently no common location in which to promote and advertise the resulting work.  ...  The abstracts are made freely available on the JFP website, i.e. not behind any paywall, and do not require any transfer for copyright, merely a license from the author.  ...  Finally, we introduce Parigot's lambda mu-calculus, which extends lambda calculus with two operators called mu and bracket, and then the extended calculus by De Groote, in which the operators mu and bracket  ... 
doi:10.1017/s0956796815000040 fatcat:g7yt23qxivevte45fkiqv6xwna

Design, Analysis and Reasoning about Tools: Abstracts from the Third Workshop

Flemming Nielson
1993 DAIMI Report Series  
Kirsten Lackner Solberg: Strictness and Totality Analysis For the simply typed lambda calculus with constants and fixed points and lazy evaluation we define a strictness analysis.  ...  Much research goes into extending the expressiveness of specifications with more quantitative information like real-time and priorities.  ... 
doi:10.7146/dpb.v22i457.6930 fatcat:qqr3ybpuqrc3fmwjlsamx3kuwu

Understanding the Expressive Power of Unhygienic Substitution in Metaprogramming via Combinatory Logic [article]

Martin Lester
2019 arXiv   pre-print
Recent work on combinatory logic demonstrates a compositional translation from lambda calculus that gives meaning to open terms.  ...  As the meaning of open terms is a key difficulty in the study of metaprogramming, we investigate whether this idea can be extended to metaprogramming systems with hygienic and unhygienic substitution,  ...  s work focuses on the translation of the metaprogramming calculus into a lambda calculus augmented with records, which they use as a means towards static analysis.  ... 
arXiv:1910.03217v1 fatcat:hc6t6tptrzdxjjpfl66ptaigqy

Page 4617 of Mathematical Reviews Vol. , Issue 2003f [page]

2003 Mathematical Reviews  
and Paul-André Melliés, Concurrent games and full completeness (431-442); Pasquale Malacaria and Chris Hankin, Non-deterministic games and program analysis: an application to security (extended abstract  ...  Riecke, Region analysis and the polymorphic lambda calculus (88-97); Serenella Cerrito and Delia Kesner, Pattern matching as cut elimination (98-108).  ... 

Towards the Average-Case Analysis of Substitution Resolution in Lambda-Calculus

Maciej Bendkowski, Michael Wagner
2019 International Conference on Rewriting Techniques and Applications  
In the current paper we propose a somewhat indirect average-case analysis of substitution resolution in the classic λ-calculus, based on the quantitative analysis of substitution in λυ, an extension of  ...  Finally, we briefly discuss applications of our approach to other term rewriting systems, focusing on two closely related formalisms, i.e. the full λυ-calculus and combinatory logic.  ...  Preliminaries Lambda upsilon calculus λυ (lambda upsilon) is a simple, first-order term rewriting system extending the classic λ-calculus based on de Bruijn indices [11] with the calculus of resolving  ... 
doi:10.4230/lipics.fscd.2019.7 dblp:conf/rta/Bendkowski19 fatcat:cnkzkvxsevgfpoxecuumlzevpy

Quantitative Static Analysis Over Semirings: Analysing Cache Behaviour for Java Card

Pascal Sotin, David Cachera, Thomas Jensen
2006 Electronical Notes in Theoretical Computer Science  
The approach is based on the quantitative abstract interpretation framework of Di Pierro and Wiklicky where programs are represented as linear operators.  ...  We present a semantics-based technique for modeling and analysing resource usage behaviour of programs written in a simple object oriented language like Java Card byte code.  ...  Acknowledgement Thanks are due to Guillaume Dufay for his thorough comments on an earlier draft of this paper, and to the referees for their valuable feedback.  ... 
doi:10.1016/j.entcs.2006.07.017 fatcat:y6zewsgpkveftakwfpcfpaeygu

Real-time MTL with durations as SMT with applications to schedulability analysis

Andre de Matos, Martin Leucker, David Pereira, Jorge Sousa Pinto
2020 2020 International Symposium on Theoretical Aspects of Software Engineering (TASE)  
RMTL-is a real-time version of metric temporal logic (MTL) extended by a duration quantifier allowing to measure time durations.  ...  We show the benefits of using RMTL-with the given SMT encoding on a diversified set of examples that include in particular its application in the area of schedulability analysis.  ...  Development Fund (ERDF) and also by national funds through the FCT, within project NORTE-01-0145-FEDER-028550 (REASSURE).  ... 
doi:10.1109/tase49443.2020.00016 fatcat:ttje24ym3bemjk5tvllknymloe

Scalable Analysis of Scalable Systems [chapter]

Allan Clark, Stephen Gilmore, Mirco Tribastone
2009 Lecture Notes in Computer Science  
We construct a high-level model using the SRMC process calculus and generate variants of this using model transformation.  ...  The models are compiled into systems of ordinary differential equations and numerically integrated to predict non-functional properties such as responsiveness and scalability.  ...  The Sensoria Reference Markovian Calculus (SRMC), as described in [2] , is a high-level modelling language which can be used for quantitative analysis of systems from the small scale to the large scale  ... 
doi:10.1007/978-3-642-00593-0_1 fatcat:ygcd42hpsjfbjltmlzztcqwodu

Page 1295 of Mathematical Reviews Vol. , Issue 2002B [page]

2002 Mathematical Reviews  
substitutions to implement objects and functions in a de Bruijn setting (204-219); Maribel Fernandez and Ian Mackie, Closed reductions in the /-calculus (extended abstract) (220-234); Samin Ishtiaq and  ...  Yonit Kesten and Amir Pnueli, Verifying liveness by augmented abstraction (141-156); Thomas Marthedal Rasmussen, Signed interval logic (157-171); Yoram Hirshfeld and Alexander Rabi- novich, Quantitative  ... 

Page 3848 of Mathematical Reviews Vol. , Issue 98F [page]

1998 Mathematical Reviews  
requiring exponential time (extended abstract) (230-241); Arie de Bruin and S.  ...  the query complexity of sets (206-217); Viviana Bono, Michele Bugliesi and Luigi Liquori, A lambda calculus of incomplete objects (218-229); Michele Boreale and Luca Tre- visan, Bisimilarity problems  ... 

Page 7662 of Mathematical Reviews Vol. , Issue 95m [page]

1995 Mathematical Reviews  
Programming 23 (1994), no. 2-3, 197-226. Summary: “We show how the Hindley/Milner polymorphic type system can be extended to incorporate overloading and subtyping.  ...  However, quantitative analysis, if it occurs at all, usually makes a clearly delayed appearance in the development process, and is almost always separate from the modelling of the functional behavior.  ... 

Page 5089 of Mathematical Reviews Vol. , Issue 2000g [page]

2000 Mathematical Reviews  
/concurrent language with higher-order value-passing (extended abstract) (239-254); Reinhold Heckmann and Michael Huth, A duality theory for quantitative semantics (255-274); Martin Hofmann, A mixed modal  ...  Sato, A clas- sical catch/throw calculus with tag abstractions and its strong normalizability (183-197); Brian Murphy and Richard P.  ... 

No more, no less - A formal model for serverless computing [article]

Maurizio Gabbrielli and Saverio Giallorenzo and Ivan Lanese and Fabrizio Montesi and Marco Peressotti and Stefano Pio Zingaro
2019 arXiv   pre-print
In this paper, we propose the first formal programming model for serverless computing, which combines ideas from both the λ-calculus (for functions) and the π-calculus (for communication).  ...  While vendors already support a variety of programming languages for serverless computing (e.g.  ...  SKC combines ideas from both the λ-calculus (for functions) and the π-calculus (for communication). In Section 2, we also extend SKC to capture limitations of current serverless implementations.  ... 
arXiv:1903.07962v2 fatcat:wcpnavpg5vcqjhmqetbmfbik2y

Counting Terms in the Binary Lambda Calculus [article]

Katarzyna Grygiel, Pierre Lescanne
2014 arXiv   pre-print
In a paper entitled Binary lambda calculus and combinatory logic, John Tromp presents a simple way of encoding lambda calculus terms as binary sequences.  ...  In what follows, we study the numbers of binary strings of a given size that represent lambda terms and derive results from their generating functions, especially that the number of terms of size n grows  ...  Basic objects of the lambda calculus are λ-terms, which are regarded as denotation for functions or computer programs.  ... 
arXiv:1401.0379v1 fatcat:gb2wj44cbfd3vegpdht6yfo3ey
« Previous Showing results 1 — 15 out of 1,179 results