Остановите войну!
for scientists:
default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
no matches
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 51 matches
- 2023
- Ewa M. Bednarczuk, Giovanni Bruccola, Gabriele Scrivanti, The Hung Tran:
Calculus rules for proximal ε-subdifferentials and inexact proximity operators for weakly convex functions. ECC 2023: 1-8 - 2022
- Naho Akiyama, Toshihiro Yamada:
A high order weak approximation for jump-diffusions using Malliavin calculus and operator splitting. Monte Carlo Methods Appl. 28(2): 97-110 (2022) - Leonardo Pacheco, Kazuyuki Tanaka:
The Alternation Hierarchy of the μ-calculus over Weakly Transitive Frames. WoLLIC 2022: 207-220 - Ewa M. Bednarczuk, Giovanni Bruccola, Gabriele Scrivanti, The Hung Tran:
Calculus rules for proximal ε-subdifferentials and inexact proximity operators for weakly convex functions. CoRR abs/2211.14525 (2022) - 2021
- Yannick Forster, Fabian Kunze, Gert Smolka, Maxi Wuttke:
A Mechanised Proof of the Time Invariance Thesis for the Weak Call-By-Value λ-Calculus. ITP 2021: 19:1-19:20 - 2020
- Yannick Forster, Fabian Kunze, Marc Roth:
The weak call-by-value λ-calculus is reasonable for both time and space. Proc. ACM Program. Lang. 4(POPL): 27:1-27:23 (2020) - 2019
- Yannick Forster, Fabian Kunze, Marc Roth:
The Weak Call-By-Value λ-Calculus is Reasonable for Both Time and Space. CoRR abs/1902.07515 (2019) - 2018
- Sylvain Dailler, David Hauzar, Claude Marché, Yannick Moy:
Instrumenting a weakest precondition calculus for counterexample generation. J. Log. Algebraic Methods Program. 99: 97-113 (2018) - Gang Bao, Yanzhao Cao, Yongle Hao, Kai Zhang:
A Robust Numerical Method for the Random Interface Grating Problem via Shape Calculus, Weak Galerkin Method, and Low-Rank Approximation. J. Sci. Comput. 77(1): 419-442 (2018) - Daniel Hausmann, Lutz Schröder, Hans-Peter Deifel:
Permutation Games for the Weakly Aconjunctive \mu μ -Calculus. TACAS (2) 2018: 361-378 - 2017
- Yannick Forster, Gert Smolka:
Weak Call-by-Value Lambda Calculus as a Model of Computation in Coq. ITP 2017: 189-206 - Daniel Hausmann, Lutz Schröder, Hans-Peter Deifel:
Permutation Games for the Weakly Aconjunctive mu-Calculus. CoRR abs/1710.08996 (2017) - 2016
- Pawel Parys, Szymon Torunczyk:
Models of Lambda-Calculus and the Weak MSO Logic. CSL 2016: 11:1-11:12 - 2013
- Lacramioara Astefanoaei, Frank S. de Boer, Mehdi Dastani, John-Jules Ch. Meyer:
A weakest precondition calculus for BUnity. Sci. Comput. Program. 78(9): 1278-1293 (2013) - 2011
- Paula Severi, Fer-Jan de Vries:
Weakening the Axiom of Overlap in Infinitary Lambda Calculus. RTA 2011: 313-328 - 2009
- Wojciech Zielonka:
Weak Implicational Logics Related to the Lambek Calculus - Gentzen versus Hilbert Formalisms. Towards Mathematical Philosophy 2009: 201-212 - 2008
- Gerardo Sánchez Licea:
Weakening the strengthened condition of Weierstrass for the isoperimetric problem in the calculus of variations. IMA J. Math. Control. Inf. 25(1): 59-74 (2008) - Ugo Dal Lago, Simone Martini:
The weak lambda calculus as a reasonable machine. Theor. Comput. Sci. 398(1-3): 32-50 (2008) - 2007
- Ariel Arbiser, Fairouz Kamareddine, Alejandro Ríos:
The Weak Normalization of the Simply Typed lambda-se-calculus. Log. J. IGPL 15(2): 121-147 (2007) - Jayasri Banerjee, Anup Kumar Bandyopadhyay, Ajit Kumar Mandal:
Some investigations on deadlock freedom issues of a cyclically connected system using Dijkstra's weakest precondition calculus. ACM SIGPLAN Notices 42(5): 10-15 (2007) - Jayasri Banerjee, Anup Kumar Bandyopadhyay, Ajit Kumar Mandal:
Application of Dijkstra's weakest precondition calculus to Dining Philosophers problem. ACM SIGSOFT Softw. Eng. Notes 32(4) (2007) - 2005
- Sandra Alves, Mário Florido:
Weak linearization of the lambda calculus. Theor. Comput. Sci. 342(1): 79-103 (2005) - Tomasz Blanc, Jean-Jacques Lévy, Luc Maranget:
Sharing in the Weak Lambda-Calculus. Processes, Terms and Cycles 2005: 70-87 - Martin Lange:
Weak Automata for the Linear Time µ-Calculus. VMCAI 2005: 267-281 - 2004
- David Janin, Giacomo Lenzi:
On the Rlationship Between Monadic and Weak Monadic Second Order Logic on Arbitrary Trees, with Applications to the mu-Calculus. Fundam. Informaticae 61(3-4): 247-265 (2004) - 2003
- Huimin Lin:
Complete inference systems for weak bisimulation equivalences in the pi-calculus. Inf. Comput. 180(1): 1-29 (2003) - Inge Li Gørtz, Signe Reuss, Morten Heine Sørensen:
Strong Normalization from Weak Normalization by Translation into the Lambda-I-Calculus. High. Order Symb. Comput. 16(3): 253-285 (2003) - 2002
- Julien Forest:
A Weak Calculus with Explicit Operators for Pattern Matching and Substitution. RTA 2002: 174-191 - Sylvain Lippi:
Package Duplication in Interaction Nets and Weak Head Reduction in the lambda-calculus. TERMGRAPH 2002: 75-86 - 2001
- Arturo Kohatsu-Higa:
Weak approximations. A Malliavin calculus approach. Math. Comput. 70(233): 135-172 (2001)
skipping 21 more matches
loading more results
failed to load more results, please try again later
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
retrieved on 2024-05-06 10:04 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint