Jens Palsberg mostly deals with Programming language, Theoretical computer science, Type inference, Inference and Algorithm. His work on Programming language deals in particular with Inheritance, Compiler, Object-oriented programming, Java and Programming paradigm. His research integrates issues of Context and Scalability in his study of Java.
His Theoretical computer science study integrates concerns from other disciplines, such as Time complexity, Set, Subtyping and Operational semantics. His Type inference research includes elements of Graph and Programmer. The concepts of his Inference study are interwoven with issues in Simple, Isolation and Lambda calculus.
His primary areas of study are Programming language, Theoretical computer science, Type inference, Compiler and Algorithm. His study in Java, Compiler construction, Compiler correctness, Object-oriented programming and Correctness is carried out as part of his studies in Programming language. In his research on the topic of Object-oriented programming, Substitution is strongly related with Inheritance.
In his study, Semantics is strongly linked to Program analysis, which falls under the umbrella field of Theoretical computer science. His Type inference study which covers Subtyping that intersects with Type and Recursive data type. As part of one scientific family, Jens Palsberg deals mainly with the area of Compiler, narrowing it down to issues related to the Parallel computing, and often Register allocation.
His primary areas of investigation include Programming language, Deadlock, Java, Theoretical computer science and Algorithm. Programming language and Memory model are two areas of study in which Jens Palsberg engages in interdisciplinary work. His study looks at the relationship between Deadlock and topics such as Concurrency, which overlap with Just-in-time compilation, Compiler correctness, Object-oriented programming, Tracing and Profiling.
His Java research incorporates elements of Scalability, Concurrent data structure, Data structure, Atomicity and Code refactoring. The study incorporates disciplines such as Compiler, Time complexity, Computation, Heuristic and Decision problem in addition to Theoretical computer science. His Algorithm research includes themes of Liveness, Normalization and Lambda calculus.
Jens Palsberg mainly investigates Programming language, Concurrency, Deadlock, Java and Distributed computing. His Programming language research integrates issues from Determinism, Type and Data parallelism. His research in Concurrency intersects with topics in Compiler and Parallel computing.
His Deadlock research is multidisciplinary, relying on both Correctness, Static analysis, Parallel algorithm, Type inference and Calculus. Jens Palsberg usually deals with Java and limits it to topics linked to Exponential number and Theoretical computer science and Decidability. Jens Palsberg studied Theoretical computer science and Reduction that intersect with Programming paradigm.
This overview was generated by a machine learning system which analysed the scientist’s body of work. If you have any feedback, you can contact us here.
Avrora: scalable sensor network simulation with precise timing
Ben L. Titzer;Daniel K. Lee;Jens Palsberg.
information processing in sensor networks (2005)
Modern Compiler Implementation in Java
Andrew W. Appel;Jens Palsberg.
A denotational semantics of inheritance and its correctness
William Cook;Jens Palsberg.
conference on object oriented programming systems languages and applications (1989)
Object-oriented type inference
Jens Palsberg;Michael I. Schwartzbach.
conference on object oriented programming systems languages and applications (1991)
Object-oriented type systems
Jens Palsberg;Michael I. Schwartzbach.
Scalable propagation-based call graph construction algorithms
Frank Tip;Jens Palsberg.
conference on object-oriented programming systems, languages, and applications (2000)
Complexity results for 1-safe nets
Allan Cheng;Javier Esparza;Jens Palsberg.
Theoretical Computer Science (1995)
The essence of the Visitor pattern
J. Palsberg;C.B. Jay.
computer software and applications conference (1998)
Zoran Budimlić;Michael Burke;Vincent Cavé;Kathleen Knobe.
Scientific Programming - Exploring Languages for Expressing Medium to Massive On-Chip Parallelism archive (2010)
Experience with software watermarking
J. Palsberg;S. Krishnaswamy;Minseok Kwon;D. Ma.
annual computer security applications conference (2000)
Profile was last updated on December 6th, 2021.
Research.com Ranking is based on data retrieved from the Microsoft Academic Graph (MAG).
The ranking h-index is inferred from publications deemed to belong to the considered discipline.
If you think any of the details on this page are incorrect, let us know.
We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below: